Work-Conserving Optimal Real-Time Scheduling on Multiprocessors

Kenji Funaoka, Shinpei Kato, Nobuyuki Yamasaki
2008 2008 Euromicro Conference on Real-Time Systems  
Extended 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
more » ... nment policies in accordance with various system requirements with several restrictions. Simulation results show that E- TNPA significantly reduces the number of task preemptions as compared to TNPA.
doi:10.1109/ecrts.2008.15 dblp:conf/ecrts/FunaokaKY08 fatcat:46yuehwpanflhofqlquffxuj3a