Sciweavers

Share
18 search results - page 1 / 4
» Tardiness Bounds under Global EDF Scheduling on a Multiproce...
Sort
View
RTSS
2005
IEEE
12 years 5 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
ECRTS
2010
IEEE
11 years 11 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...
ECRTS
2009
IEEE
11 years 9 months ago
Supporting Pipelines in Soft Real-Time Multiprocessor Systems
In work on multiprocessor real-time systems, processing pipelines have received little attention. In this paper, soft real-time periodic task systems are considered that include s...
Cong Liu, James H. Anderson
OPODIS
2010
11 years 9 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
RTCSA
2009
IEEE
12 years 6 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