Sciweavers

75 search results - page 2 / 15
» An implementation of the earliest deadline first algorithm i...
Sort
View
151
Voted
RTSS
2007
IEEE
15 years 10 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
144
Voted
TII
2008
169views more  TII 2008»
15 years 3 months ago
Fine-Tuning MAC-Level Protocols for Optimized Real-Time QoS
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...
Mathieu Grenier, Nicolas Navet
HUMAN
2003
Springer
15 years 8 months ago
Fair Real-Time Resource Allocation for Internet End System's QoS Support
Delivered end-to-end QoS is often limited by the ineffective resource management at Internet end systems. To overcome this problem, we present a resource allocation framework tha...
Jungkeun Park, Minsoo Ryu, Seongsoo Hong
110
Voted
TC
2008
15 years 3 months ago
Efficient Deadline-Based QoS Algorithms for High-Performance Networks
Quality of service (QoS) is becoming an attractive feature for high-performance networks and parallel machines because, in those environments, there are different traffic types, ea...
Alejandro Martínez-Vicente, George Apostolo...
130
Voted
SWAT
2004
Springer
125views Algorithms» more  SWAT 2004»
15 years 9 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