Sciweavers

835 search results - page 4 / 167
» Scheduling to maximize participation
Sort
View
IPPS
2009
IEEE
14 years 2 months ago
On scheduling dags to maximize area
A new quality metric, called area, is introduced for schedules that execute dags, i.e., computations having intertask dependencies. Motivated by the temporal unpredictability enco...
Gennaro Cordasco, Arnold L. Rosenberg
CODES
2008
IEEE
13 years 9 months ago
Guaranteed scheduling for repetitive hard real-time tasks under the maximal temperature constraint
We study the problem of scheduling repetitive real-time tasks with the Earliest Deadline First (EDF) policy that can guarantee the given maximal temperature constraint. We show th...
Gang Quan, Yan Zhang, William Wiles, Pei Pei
AIPS
2006
13 years 8 months ago
Incremental Scheduling to Maximize Quality in a Dynamic Environment
We present techniques for incrementally managing schedules in domains where activities accrue quality as a function of the time and resources allocated to them and the goal is to ...
Anthony Gallagher, Terry L. Zimmerman, Stephen F. ...
DSN
2009
IEEE
14 years 2 months ago
Maximizing system lifetime by battery scheduling
The use of mobile devices is limited by the battery lifetime. Some devices have the option to connect an extra battery, or to use smart battery-packs with multiple cells to extend...
Marijn R. Jongerden, Boudewijn R. Haverkort, Henri...
WDAG
2007
Springer
127views Algorithms» more  WDAG 2007»
14 years 1 months ago
A Distributed Maximal Scheduler for Strong Fairness
Abstract. Weak fairness guarantees that if an action is continuously enabled, it is executed infinitely often. Strong fairness, on the other hand, guarantees that actions that are...
Matthew Lang, Paolo A. G. Sivilotti