Work-conserving optimal real-time scheduling on multiprocessors

Kenji Funaoka, Shinpei Kato, Nobuyuki Yamasaki

Research output: Chapter in Book/Report/Conference proceedingConference contribution

45 Citations (Scopus)

Abstract

Extended T-N Plane Abstraction (E-TNPA) proposed in this paper realizes work-conserving and efficient optimal real-time scheduling on multiprocessors relative to the original T-N Plane Abstraction (TNPA). Additionally a scheduling algorithm named NVNLF (No Virtual Nodal Laxity First) is presented for E-TNPA. E-TNPA and NVNLF relax the restrictions of TNPA and the traditional algorithm LNREF, respectively. Arbitrary tasks can be preferentially executed by both tie-breaking rules and time apportionment policies in accordance with various system requirements with several restrictions. Simulation results show that E-TNPA significantly reduces the number of task preemptions as compared to TNPA.

Original languageEnglish
Title of host publicationProceedings - Euromicro Conference on Real-Time Systems
Pages13-22
Number of pages10
DOIs
Publication statusPublished - 2008
Event20th Euromicro Conference on Real-Time Systems, ECRTS 2008 - Prague, Czech Republic
Duration: 2008 Jul 22008 Jul 4

Other

Other20th Euromicro Conference on Real-Time Systems, ECRTS 2008
CountryCzech Republic
CityPrague
Period08/7/208/7/4

Fingerprint

Scheduling algorithms
Scheduling

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Funaoka, K., Kato, S., & Yamasaki, N. (2008). Work-conserving optimal real-time scheduling on multiprocessors. In Proceedings - Euromicro Conference on Real-Time Systems (pp. 13-22). [4573099] https://doi.org/10.1109/ECRTS.2008.15

Work-conserving optimal real-time scheduling on multiprocessors. / Funaoka, Kenji; Kato, Shinpei; Yamasaki, Nobuyuki.

Proceedings - Euromicro Conference on Real-Time Systems. 2008. p. 13-22 4573099.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Funaoka, K, Kato, S & Yamasaki, N 2008, Work-conserving optimal real-time scheduling on multiprocessors. in Proceedings - Euromicro Conference on Real-Time Systems., 4573099, pp. 13-22, 20th Euromicro Conference on Real-Time Systems, ECRTS 2008, Prague, Czech Republic, 08/7/2. https://doi.org/10.1109/ECRTS.2008.15
Funaoka K, Kato S, Yamasaki N. Work-conserving optimal real-time scheduling on multiprocessors. In Proceedings - Euromicro Conference on Real-Time Systems. 2008. p. 13-22. 4573099 https://doi.org/10.1109/ECRTS.2008.15
Funaoka, Kenji ; Kato, Shinpei ; Yamasaki, Nobuyuki. / Work-conserving optimal real-time scheduling on multiprocessors. Proceedings - Euromicro Conference on Real-Time Systems. 2008. pp. 13-22
@inproceedings{9f13795e55f34d8eaf89990490e0c056,
title = "Work-conserving optimal real-time scheduling on multiprocessors",
abstract = "Extended T-N Plane Abstraction (E-TNPA) proposed in this paper realizes work-conserving and efficient optimal real-time scheduling on multiprocessors relative to the original T-N Plane Abstraction (TNPA). Additionally a scheduling algorithm named NVNLF (No Virtual Nodal Laxity First) is presented for E-TNPA. E-TNPA and NVNLF relax the restrictions of TNPA and the traditional algorithm LNREF, respectively. Arbitrary tasks can be preferentially executed by both tie-breaking rules and time apportionment policies in accordance with various system requirements with several restrictions. Simulation results show that E-TNPA significantly reduces the number of task preemptions as compared to TNPA.",
author = "Kenji Funaoka and Shinpei Kato and Nobuyuki Yamasaki",
year = "2008",
doi = "10.1109/ECRTS.2008.15",
language = "English",
isbn = "9780769532981",
pages = "13--22",
booktitle = "Proceedings - Euromicro Conference on Real-Time Systems",

}

TY - GEN

T1 - Work-conserving optimal real-time scheduling on multiprocessors

AU - Funaoka, Kenji

AU - Kato, Shinpei

AU - Yamasaki, Nobuyuki

PY - 2008

Y1 - 2008

N2 - Extended T-N Plane Abstraction (E-TNPA) proposed in this paper realizes work-conserving and efficient optimal real-time scheduling on multiprocessors relative to the original T-N Plane Abstraction (TNPA). Additionally a scheduling algorithm named NVNLF (No Virtual Nodal Laxity First) is presented for E-TNPA. E-TNPA and NVNLF relax the restrictions of TNPA and the traditional algorithm LNREF, respectively. Arbitrary tasks can be preferentially executed by both tie-breaking rules and time apportionment policies in accordance with various system requirements with several restrictions. Simulation results show that E-TNPA significantly reduces the number of task preemptions as compared to TNPA.

AB - Extended T-N Plane Abstraction (E-TNPA) proposed in this paper realizes work-conserving and efficient optimal real-time scheduling on multiprocessors relative to the original T-N Plane Abstraction (TNPA). Additionally a scheduling algorithm named NVNLF (No Virtual Nodal Laxity First) is presented for E-TNPA. E-TNPA and NVNLF relax the restrictions of TNPA and the traditional algorithm LNREF, respectively. Arbitrary tasks can be preferentially executed by both tie-breaking rules and time apportionment policies in accordance with various system requirements with several restrictions. Simulation results show that E-TNPA significantly reduces the number of task preemptions as compared to TNPA.

UR - http://www.scopus.com/inward/record.url?scp=52049101764&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=52049101764&partnerID=8YFLogxK

U2 - 10.1109/ECRTS.2008.15

DO - 10.1109/ECRTS.2008.15

M3 - Conference contribution

AN - SCOPUS:52049101764

SN - 9780769532981

SP - 13

EP - 22

BT - Proceedings - Euromicro Conference on Real-Time Systems

ER -