75 search results - page 3 / 15 » An implementation of the earliest deadline first algorithm i... |
EUC
2008
Springer
13 years 8 months ago
2008
Springer
This paper presents real-time scheduling techniques for reducing the response time of aperiodic tasks scheduled with real-time periodic tasks on multiprocessor systems. Two proble...
RTSS
1997
IEEE
13 years 10 months ago
1997
IEEE
In certain real-time applications, ranging from multimedia to telecommunication systems, timing constraints can be more flexible than scheduling theory usually permits. For exampl...
ICPP
2006
IEEE
14 years 7 days ago
2006
IEEE
The advent of service-oriented Grid computing has resulted in the need for Grid resources such as clusters to enforce user-specific service needs and expectations. Service Level ...
RTSS
1992
IEEE
13 years 10 months ago
1992
IEEE
The problem of scheduling a set of sporadic tasks that share a set of serially reusable, single unit software resources on a single processor is considered. The correctness condit...
OPODIS
2010
13 years 4 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...