Compiler and Runtime Support for Hybrid Static/Dynamic Scheduling
Lists
Only you see this
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.
BibTeX
@inproceedings{vandierendonck2015compiler,
author = {Hans Vandierendonck},
title = {{Compiler and Runtime Support for Hybrid Static/Dynamic Scheduling}},
booktitle = {Research},
year = {2015},
}Loading related content...