93 search results - page 8 / 19 » Fault-Tolerant Earliest-Deadline-First Scheduling Algorithm |
DATE
2004
IEEE
13 years 11 months ago
2004
IEEE
Given a set of real-time tasks scheduled using the earliest deadline first (EDF) algorithm, we discuss two techniques for reducing power consumption while meeting all timing requi...
IPPS
1997
IEEE
13 years 11 months ago
1997
IEEE
This paper presents a new fault-tolerant scheduling algorithm for multiprocessor hard-real-time systems. The so called partitioning method is used to schedule a set of tasks in a ...
CEE
2007
13 years 7 months ago
2007
Real-time systems are often designed using preemptive scheduling and worst-case execution time estimates to guarantee the execution of high priority tasks. There is, however, an i...
RTSS
2005
IEEE
14 years 1 months ago
2005
IEEE
Monitoring network status such as end-to-end delay, jitter, and available bandwidth is important to support QoS-sensitive applications and timely detection of network anomalies li...
INFOCOM
2003
IEEE
14 years 23 days ago
2003
IEEE
— In this paper, we consider real-time speech traffic, real-time circuit-switched data (CSD) and non-real-time packetswitched data (PSD) in the UMTS Terrestrial Radio Access Net...