Abstract
This paper proposes an efficient real-time scheduling algorithm for multiprocessor platforms. The algorithm is a derivative of the Rate Monotonic (RM) algorithm, with its basis on the portioned scheduling technique. The theoretical design of the algorithmis well implementable for practical use. The schedulability of the algorithm is also analyzed to guarantee the worst-case performance. The simulation results show that the algorithm achieves higher system utilizations, in which all tasks meet deadlines, with a small number of preemptions compared to traditional algorithms.
| Original language | English |
|---|---|
| Title of host publication | IPDPS Miami 2008 - Proceedings of the 22nd IEEE International Parallel and Distributed Processing Symposium, Program and CD-ROM |
| DOIs | |
| Publication status | Published - 2008 Sep 10 |
| Event | IPDPS 2008 - 22nd IEEE International Parallel and Distributed Processing Symposium - Miami, FL, United States Duration: 2008 Apr 14 → 2008 Apr 18 |
Publication series
| Name | IPDPS Miami 2008 - Proceedings of the 22nd IEEE International Parallel and Distributed Processing Symposium, Program and CD-ROM |
|---|
Other
| Other | IPDPS 2008 - 22nd IEEE International Parallel and Distributed Processing Symposium |
|---|---|
| Country | United States |
| City | Miami, FL |
| Period | 08/4/14 → 08/4/18 |
ASJC Scopus subject areas
- Hardware and Architecture
- Software
- Electrical and Electronic Engineering
Fingerprint Dive into the research topics of 'Portioned static-priority scheduling on multiprocessors'. Together they form a unique fingerprint.
Cite this
Kato, S., & Yamasaki, N. (2008). Portioned static-priority scheduling on multiprocessors. In IPDPS Miami 2008 - Proceedings of the 22nd IEEE International Parallel and Distributed Processing Symposium, Program and CD-ROM [4536299] (IPDPS Miami 2008 - Proceedings of the 22nd IEEE International Parallel and Distributed Processing Symposium, Program and CD-ROM). https://doi.org/10.1109/IPDPS.2008.4536299