A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
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 timedoi:10.1109/ecrts.2008.15 dblp:conf/ecrts/FunaokaKY08 fatcat:46yuehwpanflhofqlquffxuj3a