253 search results - page 25 / 51 » Approximation algorithm for the temperature-aware scheduling... |
129
click to vote
APPROX
2006
Springer
15 years 5 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...
IPPS
2005
IEEE
15 years 7 months ago
2005
IEEE
This paper studies distributed scheduling of parallel I/O data transfers on systems that provide data replication. In our previous work, we proposed a centralized algorithm for so...
125
click to vote
IJCSA
2007
15 years 1 months ago
2007
The problem of task assignment in heterogeneous computing systems has been studied for many years with many variations. We have developed a new hybrid approximation algorithm. The...
112
click to vote
IPPS
2009
IEEE
15 years 8 months ago
2009
IEEE
In this paper, we deal with the large-scale divisible load problem studied in [12]. We show how to reduce this problem to a classical preemptive scheduling problem on a single mac...
120
click to vote
INFOCOM
2009
IEEE
15 years 8 months ago
2009
IEEE
— Minimum-latency beaconing schedule (MLBS) in synchronous multihop wireless networks seeks a schedule for beaconing with the shortest latency. This problem is NP-hard even when ...