Sciweavers

Share
ECRTS
2008
IEEE

Work-Conserving Optimal Real-Time Scheduling on Multiprocessors

9 years 1 months ago
Work-Conserving Optimal Real-Time Scheduling on Multiprocessors
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 ETNPA significantly reduces the number of task preemptions as compared to TNPA.
Kenji Funaoka, Shinpei Kato, Nobuyuki Yamasaki
Added 29 May 2010
Updated 29 May 2010
Type Conference
Year 2008
Where ECRTS
Authors Kenji Funaoka, Shinpei Kato, Nobuyuki Yamasaki
Comments (0)
books