Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Conferences, Workshops, Symposiums, and Seminars
  4. Adaptive Execution of OpenMP Task Parallel Programs
 
conference paper

Adaptive Execution of OpenMP Task Parallel Programs

Scherer, A.
•
Gross, T.
•
Zwaenepoel, W.  
2000
LCR 2000: Languages, Compilers, and Run-Time Systems for Scalable Computers
Languages, Compilers, and Runtimes for Scalable Computing

We present a system that allows task parallel OpenMP pro grams to execute on a network of workstations (NOW) with a variable number of nodes Such adaptivity, generally called adaptive parallelism, is important in a multi-user NOW environment, enabling the system to expand the computation onto idle nodes or withdraw from otherwise occupied nodes. We focus on task parallel applications in this paper, but the system also lets data parallel applications run adaptively. When an adaptation is requested, we let all processes complete theircurrent tasks, then the system executes an extra OpenMP join-fork sequence not present in the application code. Here, the system can change the number of nodes without involving the application, as processes do not have a compute-relevant private process state. We show that the costs of adaptations is low, and we explain why the costs are lower for task parallel applications than for data parallel applications.

  • Files
  • Details
  • Metrics
Loading...
Thumbnail Image
Name

lcr00a.ps.pdf

Access type

openaccess

Size

236.69 KB

Format

Adobe PDF

Checksum (MD5)

4d9700fb676661d5a6cc403edcac0459

Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés