Sciweavers

93 search results - page 2 / 19
» Fault-Tolerant Earliest-Deadline-First Scheduling Algorithm
Sort
View
RTSS
2007
IEEE
13 years 11 months ago
Analysis of Hierarchical EDF Pre-emptive Scheduling
This paper focuses on scheduling different hard real-time applications on a uniprocessor when the earliest deadline first algorithm is used as the local scheduler, and the global ...
Fengxiang Zhang, Alan Burns
EUC
2008
Springer
13 years 6 months ago
Scheduling Aperiodic Tasks Using Total Bandwidth Server on Multiprocessors
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...
Shinpei Kato, Nobuyuki Yamasaki
SWAT
2004
Springer
125views Algorithms» more  SWAT 2004»
13 years 10 months ago
The Optimal Online Algorithms for Minimizing Maximum Lateness
It is well known that the Earliest-Deadline-First (EDF) and the Least-Laxity-First (LLF) algorithms are optimal algorithms for the problem of preemptively scheduling jobs that arr...
Patchrawat Uthaisombut
ECRTS
2003
IEEE
13 years 10 months ago
Characteristics of EDF Schedulability on Uniform Multiprocessors
In uniform multiprocessor platforms, the various processors comprising the multiprocessor platform may have different computing capacities. The focus of this paper is the design o...
Shelby Funk, Sanjoy K. Baruah
RTAS
2008
IEEE
13 years 11 months ago
Hybrid-priority Scheduling of Resource-Sharing Sporadic Task Systems
A hybrid scheduling algorithm is proposed, which integrates features of the Fixed Priority (FP) and Earliest Deadline First (EDF) scheduling policies. It is shown that this hybrid...
Sanjoy K. Baruah, Nathan Fisher