506 search results - page 41 / 102 » State-Dependent Deadline Scheduling |
RTCSA
1999
IEEE
14 years 2 months ago
1999
IEEE
Replication is a well-know fault-tolerance technique, and several replication strategies exist (e.g. active, passive, and semi-active replication). To be used in hard real-time sy...
CLOUDCOM
2009
Springer
14 years 1 months ago
2009
Springer
Workflows are modeled as hierarchically structured directed acyclic graphs in which vertices represent computational tasks, referred to as requests, and edges represent precedent c...
ECRTS
2004
IEEE
14 years 1 months ago
2004
IEEE
This paper targets energy-efficient scheduling of tasks over multiple processors, where tasks share a common deadline. Distinct from many research results on heuristics-based ener...
CN
2008
13 years 10 months ago
2008
Providing end-to-end delay guarantees for delay sensitive applications is an important packet scheduling issue with routers. In this paper, to support end-to-end delay requirement...
ECRTS
2003
IEEE
14 years 3 months ago
2003
IEEE
Utilization bounds for schedulability of aperiodic tasks are new in real-time scheduling literature. All aperiodic bounds known to date apply only to independent tasks. They eithe...