Projects per year
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.
|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||Compilers for Parallel Computing (CPC'15)|
|Period||07/01/2015 → 09/01/2015|