506 search results - page 10 / 102 » State-Dependent Deadline Scheduling |
ISLPED
2007
ACM
13 years 10 months ago
2007
ACM
We address power minimization of earliest deadline first and ratemonotonic schedules by voltage and frequency scaling. We prove that the problems are NP-hard, and present (1+ ) f...
ICA3PP
2005
Springer
14 years 2 months ago
2005
Springer
In this paper, we present an algorithm for scheduling of distributed data intensive Bag-of-Task applications on Data Grids that have costs associated with requesting, transferring ...
IPPS
2007
IEEE
14 years 2 months ago
2007
IEEE
The general approach to fault tolerance in uniprocessor systems is to maintain enough time redundancy in the schedule so that any task instance can be re-executed in presence of f...
RTSS
1994
IEEE
14 years 19 days ago
1994
IEEE
In this paper we present four new on-line algorithms for servicing soft aperiodic requests in real-time systems, where a set of hard periodic lash is scheduled using the Earliest ...
RTAS
2005
IEEE
14 years 2 months ago
2005
IEEE
Consider a team of robots equipped with sensors that collaborate with one another to achieve a common goal. Sensors on robots produce periodic updates that must be transmitted to ...