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 |
| Event | IPDPS 2008 - 22nd IEEE International Parallel and Distributed Processing Symposium - Miami, FL, United States Duration: 2008 Apr 14 → 2008 Apr 18 |
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 |
Fingerprint
ASJC Scopus subject areas
- Hardware and Architecture
- Software
- Electrical and Electronic Engineering
Cite this
Portioned static-priority scheduling on multiprocessors. / Kato, Shinpei; Yamasaki, Nobuyuki.
IPDPS Miami 2008 - Proceedings of the 22nd IEEE International Parallel and Distributed Processing Symposium, Program and CD-ROM. 2008. 4536299.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Portioned static-priority scheduling on multiprocessors
AU - Kato, Shinpei
AU - Yamasaki, Nobuyuki
PY - 2008
Y1 - 2008
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=51049098730&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=51049098730&partnerID=8YFLogxK
U2 - 10.1109/IPDPS.2008.4536299
DO - 10.1109/IPDPS.2008.4536299
M3 - Conference contribution
AN - SCOPUS:51049098730
SN - 9781424416943
BT - IPDPS Miami 2008 - Proceedings of the 22nd IEEE International Parallel and Distributed Processing Symposium, Program and CD-ROM
ER -