Sciweavers

841 search results - page 67 / 169
» Job Scheduling in Rings
Sort
View
ESA
2010
Springer
140views Algorithms» more  ESA 2010»
15 years 2 days ago
A Robust PTAS for Machine Covering and Packing
Abstract. Minimizing the makespan or maximizing the minimum machine load are two of the most important and fundamental parallel machine scheduling problems. In an online scenario, ...
Martin Skutella, José Verschae
IISWC
2006
IEEE
15 years 5 months ago
Predicting Bounds on Queuing Delay in Space-shared Computing Environments
Most space-sharing resources presently operated by high performance computing centers employ some sort of batch queueing system to manage resource allocation to multiple users. In...
John Brevik, Daniel Nurmi, Richard Wolski
ICALP
2003
Springer
15 years 5 months ago
Convergence Time to Nash Equilibria
We study the number of steps required to reach a pure Nash Equilibrium in a load balancing scenario where each job behaves selfishly and attempts to migrate to a machine which will...
Eyal Even-Dar, Alexander Kesselman, Yishay Mansour
CLUSTER
2004
IEEE
15 years 3 months ago
Bandwidth-aware co-allocating meta-schedulers for mini-grid architectures
The interaction of simultaneously co-allocated jobs can often create contention in the network infrastructure of a dedicated computational grid. This contention can lead to degrad...
William M. Jones, Louis W. Pang, Walter B. Ligon I...
CLUSTER
2006
IEEE
14 years 12 months ago
A taxonomy of application scheduling tools for high performance cluster computing
Application scheduling plays an important role in high-performance cluster computing. Application scheduling can be classified as job scheduling and task scheduling. This paper pre...
Jiannong Cao, Alvin T. S. Chan, Yudong Sun, Sajal ...