New abstraction for optimal real-time scheduling on multiprocessors

Kenji Funaoka, Shinpei Kato, Nobuyuki Yamasaki

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

3 Citations (Scopus)

Abstract

T-R Plane Abstraction (TRPA) proposed in this paper is an abstraction technique of real-time scheduling on multi-processors. This paper presents that NNLF (No Nodal Laxity First) based on TRPA is work-conserving and optimally solves the problem of scheduling periodic tasks on a multiprocessor system. TRPA can accommodate to dynamic environments due to its dynamic time reservation, while T-N Plane Abstraction (TNPA) and Extended TNPA (E-TNPA) reserve processor time statically at every task release.

Original languageEnglish
Title of host publicationProceedings - 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2008
Pages357-364
Number of pages8
DOIs
Publication statusPublished - 2008 Oct 15
Event14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2008 - Kaohsiung, Taiwan, Province of China
Duration: 2008 Aug 252008 Aug 27

Publication series

NameProceedings - 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2008

Other

Other14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2008
CountryTaiwan, Province of China
CityKaohsiung
Period08/8/2508/8/27

ASJC Scopus subject areas

  • Computer Science Applications
  • Hardware and Architecture
  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'New abstraction for optimal real-time scheduling on multiprocessors'. Together they form a unique fingerprint.

Cite this