Compiler and Runtime Support for Hybrid Static/Dynamic Scheduling

Research output: Contribution to conferenceAbstract

281 Downloads (Pure)


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 languageEnglish
Number of pages1
Publication statusPublished - 07 Jan 2015
EventCompilers for Parallel Computing (CPC'15) - Imperial College London, London, United Kingdom
Duration: 07 Jan 201509 Jan 2015


WorkshopCompilers for Parallel Computing (CPC'15)
Country/TerritoryUnited Kingdom


Dive into the research topics of 'Compiler and Runtime Support for Hybrid Static/Dynamic Scheduling'. Together they form a unique fingerprint.

Cite this