254 search results - page 28 / 51 » Approximation Algorithms for Scheduling Parallel Jobs |
ICALP
2003
Springer
15 years 4 months ago
2003
Springer
We study algorithmic problems that are motivated by bandwidth trading in next generation networks. Typically, bandwidth trading involves sellers (e.g., network operators) interest...
103
click to vote
ESA
1999
Springer
15 years 3 months ago
1999
Springer
We give a polynomial approximation scheme for the problem of scheduling on uniformly related parallel machines for a large class of objective functions that depend only on the mac...
STACS
2009
Springer
15 years 5 months ago
2009
Springer
We present a unified optimal semi-online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize the makespan. This algorithm works for a...
157
click to vote
PDPTA
2008
15 years 15 days ago
2008
- Load balancing is a crucial issue in parallel and distributed systems to ensure fast processing and optimum utilization of computing resources. Load balancing strategies try to e...
115
click to vote
JSSPP
2001
Springer
15 years 3 months ago
2001
Springer
The Maui scheduler has received wide acceptance in the HPC community as a highly configurable and effective batch scheduler. It is currently in use on hundreds of SP, O2K, and Li...