New Abstraction for Optimal Real-Time Scheduling on Multiprocessors
Kenji Funaoka, Shinpei Kato, Nobuyuki Yamasaki · 2008
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.