Work-conserving optimal real-time scheduling on multiprocessors

Kenji Funaoka, Shinpei Kato, Nobuyuki Yamasaki

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

47 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 of the 20th Euromicro Conference on Real-Time Systems, ECRTS 2008
Pages13-22
Number of pages10
DOIs
Publication statusPublished - 2008 Sep 24
Event20th Euromicro Conference on Real-Time Systems, ECRTS 2008 - Prague, Czech Republic
Duration: 2008 Jul 22008 Jul 4

Publication series

NameProceedings - Euromicro Conference on Real-Time Systems
ISSN (Print)1068-3070

Other

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

    Fingerprint

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture

Cite this

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