139 search results - page 22 / 28 » Scheduling equal-length jobs on identical parallel machines |
EUROPAR
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We consider parallel prefix computation on processors of different and possibly changing speeds. Extending previous works on identical processors, we provide a lower boun...
MFCS
2004
Springer
15 years 3 months ago
2004
Springer
We study the problem of optimal preemptive scheduling with respect to a general target function. Given n jobs with associated weights and m ≤ n uniformly related machines, one a...
SPAA
2006
ACM
15 years 3 months ago
2006
ACM
Suppose we have a parallel or distributed system whose nodes have limited capacities, such as processing speed, bandwidth, memory, or disk space. How does the performance of the s...
TC
2002
14 years 9 months ago
2002
The low cost and wide availability of networks of workstations have made them an attractive solution for high performance computing. However, while a network of workstations may be...
106
click to vote
HIPC
2000
Springer
15 years 1 months ago
2000
Springer
Heterogeneous computing environments have become attractive platforms to schedule computationally intensive jobs. We consider the problem of mapping independent tasks onto machines...