18 search results - page 1 / 4 » Tardiness Bounds under Global EDF Scheduling on a Multiproce... |
RTSS
2005
IEEE
14 years 4 months ago
2005
IEEE
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...
ECRTS
2010
IEEE
13 years 11 months ago
2010
IEEE
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...
ECRTS
2009
IEEE
13 years 9 months ago
2009
IEEE
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...
OPODIS
2010
13 years 9 months ago
2010
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...
RTCSA
2009
IEEE
14 years 5 months ago
2009
IEEE
Soft real-time sporadic multiprocessor task systems are considered that include processing pipelines. Conditions are presented for guaranteeing bounded deadline tardiness in such ...