Sciweavers

Share
8 search results - page 1 / 2
» Improved Tardiness Bounds for Global EDF
Sort
View
ECRTS
2010
IEEE
12 years 2 months ago
Improved Tardiness Bounds for Global EDF
The Earliest Deadline First scheduling algorithm (EDF) is known to not be optimal under global scheduling on multiprocessor platforms. Results have been obtained that bound the ma...
Jeremy P. Erickson, UmaMaheswari Devi, Sanjoy K. B...
OPODIS
2010
11 years 11 months ago
Tardiness Bounds for Global EDF with Deadlines Different from Periods
The Earliest Deadline First (EDF) scheduling algorithm is known to be suboptimal for meeting all deadlines under global scheduling on multiprocessor platforms. However, EDF is an a...
Jeremy Erickson, Nan Guan, Sanjoy K. Baruah
RTSS
2005
IEEE
12 years 7 months ago
Tardiness Bounds under Global EDF Scheduling on a Multiprocessor
We consider the scheduling of a sporadic real-time task system on an identical multiprocessor. Though Pfair algorithms are theoretically optimal for such task systems, in practice...
UmaMaheswari C. Devi, James H. Anderson
RTS
2008
155views more  RTS 2008»
12 years 1 months ago
An EDF-based restricted-migration scheduling algorithm for multiprocessor soft real-time systems
There has been much recent interest in the use of the earliest-deadline-first (EDF) algorithm for scheduling soft real-time sporadic task systems on identical multiprocessors. In ...
James H. Anderson, Vasile Bud, UmaMaheswari C. Dev...
RTCSA
2009
IEEE
12 years 8 months ago
Supporting Sporadic Pipelined Tasks with Early-Releasing in Soft Real-Time Multiprocessor Systems
Soft real-time sporadic multiprocessor task systems are considered that include processing pipelines. Conditions are presented for guaranteeing bounded deadline tardiness in such ...
Cong Liu, James H. Anderson
books