New Abstraction for Optimal Real-Time Scheduling on Multiprocessors

Authors:
Kenji Funaoka;Shinpei Kato;Nobuyuki Yamasaki
Affiliations:
-;-;-
Venue:
RTCSA '08 Proceedings of the 2008 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Year:
2008

Citing 0
Cited 1

DP-Fair: a unifying theory for optimal hard real-time multiprocessor scheduling

Real-Time Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

T-R Plane Abstraction (TRPA) proposed in this paper is an abstraction technique of real-time scheduling on multiprocessors. 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.