New abstraction for optimal real-time scheduling on multiprocessors

Kenji Funaoka; Shinpei Kato; Nobuyuki Yamasaki

doi:10.1109/RTCSA.2008.15

New abstraction for optimal real-time scheduling on multiprocessors

Kenji Funaoka, Shinpei Kato, Nobuyuki Yamasaki

Department of Information and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English
Title of host publication	Proceedings - 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2008
Pages	357-364
Number of pages	8
DOIs	https://doi.org/10.1109/RTCSA.2008.15
Publication status	Published - 2008 Oct 15
Event	14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2008 - Kaohsiung, Taiwan, Province of China Duration: 2008 Aug 25 → 2008 Aug 27

Publication series

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

Other

Other	14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2008
Country/Territory	Taiwan, Province of China
City	Kaohsiung
Period	08/8/25 → 08/8/27

ASJC Scopus subject areas

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

Access to Document

10.1109/RTCSA.2008.15

Cite this

Funaoka, K., Kato, S., & Yamasaki, N. (2008). New abstraction for optimal real-time scheduling on multiprocessors. In Proceedings - 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2008 (pp. 357-364). Article 4617305 (Proceedings - 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2008). https://doi.org/10.1109/RTCSA.2008.15

New abstraction for optimal real-time scheduling on multiprocessors. / Funaoka, Kenji; Kato, Shinpei; Yamasaki, Nobuyuki.
Proceedings - 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2008. 2008. p. 357-364 4617305 (Proceedings - 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2008).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Funaoka, K, Kato, S & Yamasaki, N 2008, New abstraction for optimal real-time scheduling on multiprocessors. in Proceedings - 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2008., 4617305, Proceedings - 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2008, pp. 357-364, 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2008, Kaohsiung, Taiwan, Province of China, 08/8/25. https://doi.org/10.1109/RTCSA.2008.15

Funaoka K, Kato S, Yamasaki N. New abstraction for optimal real-time scheduling on multiprocessors. In Proceedings - 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2008. 2008. p. 357-364. 4617305. (Proceedings - 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2008). doi: 10.1109/RTCSA.2008.15

Funaoka, Kenji ; Kato, Shinpei ; Yamasaki, Nobuyuki. / New abstraction for optimal real-time scheduling on multiprocessors. Proceedings - 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2008. 2008. pp. 357-364 (Proceedings - 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2008).

@inproceedings{2eff45b1fbeb4b309e81f3521a0675e0,

title = "New abstraction for optimal real-time scheduling on multiprocessors",

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.",

author = "Kenji Funaoka and Shinpei Kato and Nobuyuki Yamasaki",

year = "2008",

month = oct,

day = "15",

doi = "10.1109/RTCSA.2008.15",

language = "English",

isbn = "9780769533490",

series = "Proceedings - 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2008",

pages = "357--364",

booktitle = "Proceedings - 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2008",

note = "14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2008 ; Conference date: 25-08-2008 Through 27-08-2008",

}

TY - GEN

T1 - New abstraction for optimal real-time scheduling on multiprocessors

AU - Funaoka, Kenji

AU - Kato, Shinpei

AU - Yamasaki, Nobuyuki

PY - 2008/10/15

Y1 - 2008/10/15

N2 - 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.

AB - 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.

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

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

U2 - 10.1109/RTCSA.2008.15

DO - 10.1109/RTCSA.2008.15

M3 - Conference contribution

AN - SCOPUS:53549097374

SN - 9780769533490

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

SP - 357

EP - 364

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

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

Y2 - 25 August 2008 through 27 August 2008

ER -

New abstraction for optimal real-time scheduling on multiprocessors

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this