402 search results - page 1 / 81 » Gang EDF Scheduling of Parallel Task Systems |
RTSS
2009
IEEE
13 years 12 months ago
2009
IEEE
The preemptive real-time scheduling of sporadic parallel task systems is studied. We present an algorithm, called Gang EDF, which applies the Earliest Deadline First (EDF) policy ...
IPPS
2009
IEEE
13 years 12 months ago
2009
IEEE
Gang scheduling is considered to be a highly effective task scheduling policy for distributed systems. In this paper we present a migration scheme which reduces the fragmentation ...
RTSS
1999
IEEE
13 years 9 months ago
1999
IEEE
Despite the significant body of results in real-time scheduling, many real world problems are not easily supported. While algorithms such as Earliest Deadline First, Rate Monotoni...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
OPODIS
2010
13 years 3 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...