34 search results - page 1 / 7 » Scheduling to minimize average stretch without migration |
SODA
2000
ACM
13 years 6 months ago
2000
ACM
APPROX
2006
Springer
13 years 8 months ago
2006
Springer
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
VLSID
2007
IEEE
14 years 5 months ago
2007
IEEE
We present minimization methodologies and an algorithm for simultaneous scheduling, binding, and allocation for the reduction of total power and power fluctuation during behaviora...
ISCAS
2003
IEEE
13 years 10 months ago
2003
IEEE
Switching activity is one of the most important factors in power dissipation. This paper studies the scheduling problem that minimizes both schedule length and switching activitie...
ALGORITHMICA
2004
13 years 4 months ago
2004
We consider the problem of scheduling dynamically arriving jobs in a non-clairvoyant setting, that is, when the size of a job in remains unknown until the job finishes execution. ...