Sciweavers

1125 search results - page 60 / 225
» On the job rotation problem
Sort
View
IPPS
2002
IEEE
14 years 2 months ago
Load Balancing in Distributed Systems: An Approach Using Cooperative Games
In this paper we formulate the static load balancing problem in single class job distributed systems as a cooperative game among computers. It is shown that the Nash Bargaining So...
Daniel Grosu, Anthony T. Chronopoulos, Ming-Ying L...
IPL
2008
103views more  IPL 2008»
13 years 10 months ago
New efficiency results for makespan cost sharing
In the context of scheduling, we study social cost efficiency for a cost-sharing problem in which the service provider's cost is determined by the makespan of the served agen...
Yvonne Bleischwitz, Florian Schoppmann
4OR
2004
90views more  4OR 2004»
13 years 9 months ago
A MIP approach for some practical packing problems: Balancing constraints and tetris-like items
This paper considers packing problems with balancing conditions and items consisting of clusters of parallelepipeds (mutually orthogonal, i.e. tetris-like items). This issue is qu...
Giorgio Fasano
STOC
2002
ACM
115views Algorithms» more  STOC 2002»
14 years 10 months ago
Stability of load balancing algorithms in dynamic adversarial systems
In the dynamic load balancing problem, we seek to keep the job load roughly evenly distributed among the processors of a given network. The arrival and departure of jobs is modeled...
Elliot Anshelevich, David Kempe, Jon M. Kleinberg
ALGORITHMICA
2008
110views more  ALGORITHMICA 2008»
13 years 10 months ago
Bandwidth-Constrained Allocation in Grid Computing
Grid computing systems pool together the resources of many workstations to create a virtual computing reservoir. Users can "draw" resources using a pay-as-you-go model, c...
Anshul Kothari, Subhash Suri, Yunhong Zhou