506 search results - page 3 / 102 » State-Dependent Deadline Scheduling |
APPROX
2000
Springer
13 years 11 months ago
2000
Springer
In this paper, we derive bounds on performance guarantees of online algorithms for real-time preemptive scheduling of jobs with deadlines on K machines when jobs are characterized ...
RTSS
2007
IEEE
14 years 1 months ago
2007
IEEE
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 ...
RTAS
2006
IEEE
14 years 1 months ago
2006
IEEE
Prior research on schedulability bounds focused primarily on bounding utilization as a means to meet deadline constraints. Non-trivial bounds were found for a handful of schedulin...
JSAC
2011
12 years 10 months ago
2011
—This paper studies the problem of scheduling in single-hop wireless networks with real-time traffic, where every packet arrival has an associated deadline and a minimum fractio...
RTS
2011
12 years 10 months ago
2011
This paper is an extended version of a paper that appeared in the proceedings of the IEEE Real-Time Systems Symposium 2009. This paper has been updated with respect to advances ma...