Abstract
One of the outstanding issues in parallel computing is the selection of task granularity. This work proposes a solution to the task granularity problem by lowering the overhead of the task scheduler and as such supporting very fine-grain tasks. Using a combination of static (compile-time) scheduling and dynamic (run-time) scheduling, we aim to make scheduling decisions as fast as with static scheduling while retaining the dynamic load- balancing properties of fully dynamic scheduling. We present an example application and discuss the requirements on the compiler and runtime system to realize hybrid static/dynamic scheduling.
| Original language | English |
|---|---|
| Number of pages | 1 |
| Publication status | Published - 07 Jan 2015 |
| Event | Compilers for Parallel Computing (CPC'15) - Imperial College London, London, United Kingdom Duration: 07 Jan 2015 → 09 Jan 2015 |
Workshop
| Workshop | Compilers for Parallel Computing (CPC'15) |
|---|---|
| Country/Territory | United Kingdom |
| City | London |
| Period | 07/01/2015 → 09/01/2015 |
Fingerprint
Dive into the research topics of 'Compiler and Runtime Support for Hybrid Static/Dynamic Scheduling'. Together they form a unique fingerprint.Projects
- 1 Finished
-
R1451CSC: Hybrid Static/Dynamic Scheduling for Task Dataflow Parallel Programs
Vandierendonck, H. (PI)
28/07/2014 → 02/03/2017
Project: Research
Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver