Abstract
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 1960’s to the latest research published in late 2009. The survey outlines fundamental results about multiprocessor realtime 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.
| Original language | English |
|---|---|
| Article number | 35 |
| Pages (from-to) | 35:1 -35:44 |
| Number of pages | 44 |
| Journal | ACM Comput. Surv. |
| Volume | 43 |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - 1 Oct 2011 |
Bibliographical note
DOI: 10.1145/1978802.1978814Keywords
- real-time
- schedulability analysis
- multiprocesor
- multicore
- survey
- Scheduling