Journal
ACM COMPUTING SURVEYS
Volume 43, Issue 4, Pages -Publisher
ASSOC COMPUTING MACHINERY
DOI: 10.1145/1978802.1978814
Keywords
Performance; Design; Algorithms; Hard real-time scheduling; global scheduling; partitioned scheduling; multiprocessor; multicore
Categories
Funding
- EU [216682]
- eMuCo [216378]
- EU
- EPSRC [EP/G055548/1]
- EPSRC [EP/G055548/1] Funding Source: UKRI
- Engineering and Physical Sciences Research Council [EP/G055548/1] Funding Source: researchfish
Ask authors/readers for more resources
This survey covers hard real-time scheduling algorithms and schedulability analysis techniques for homogeneous multiprocessor systems. It reviews the key results in this field from its origins in the late 1960s to the latest research published in late 2009. The survey outlines fundamental results about multiprocessor real-time scheduling that hold independent of the scheduling algorithms employed. It provides a taxonomy of the different scheduling methods, and considers the various performance metrics that can be used for comparison purposes. A detailed review is provided covering partitioned, global, and hybrid scheduling algorithms, approaches to resource sharing, and the latest results from empirical investigations. The survey identifies open issues, key research challenges, and likely productive research directions.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available