93 search results - page 7 / 19 » Fault-Tolerant Earliest-Deadline-First Scheduling Algorithm |
RTAS
2010
IEEE
13 years 5 months ago
2010
IEEE
The management of tasks is an essential requirement in most real-time and embedded systems, but invariably leads to unwanted CPU overheads. This paper is concerned with task manage...
TII
2008
13 years 7 months ago
2008
In distributed real-time systems, meeting the real-time constraints is mandatory but the satisfaction of other application-dependent criteria is most generally required as well. I...
OPODIS
2010
13 years 5 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...
RTS
2006
13 years 7 months ago
2006
Many of today's complex computer applications are being modeled and constructed using the principles inherent to real-time distributed object systems. In response to this dem...
EMSOFT
2003
Springer
14 years 21 days ago
2003
Springer
Since the first results published in 1973 by Liu and Layland on the Rate Monotonic (RM) and Earliest Deadline First (EDF) algorithms, a lot of progress has been made in the schedu...