Multicore scheduling of parallel real-time tasks with multiple parallelization options
2015
Past researches on multicore scheduling assume that a computational unit has already been parallelized into a prefixed number of threads. However, with recent technologies such as OpenCL, a computational unit can be parallelized in many different ways with runtime selectable numbers of threads. This paper proposes an optimal algorithm for parallelizing and scheduling a set of parallel tasks with multiple parallelization options on multiple CPU cores. The proposed algorithm is validated through both simulation and actual implementation. To the best of our knowledge, this is the first work addressing the problem of scheduling real-time tasks with multiple parallelization options on multiple CPU cores.
Keywords:
- Real-time computing
- Gang scheduling
- Fixed-priority pre-emptive scheduling
- Parallel computing
- Fair-share scheduling
- Earliest deadline first scheduling
- Distributed computing
- Two-level scheduling
- Dynamic priority scheduling
- Rate-monotonic scheduling
- Round-robin scheduling
- Computer science
- Multiprocessor scheduling
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
19
References
19
Citations
NaN
KQI