Matthew Andrews Michel X. Goemans  Home/Search
Context Related
| belllabs.com/cm/ms/who/andre...load.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: belllabs.com/cm/ms/who/and...pub (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We consider the following load balancing problem. Jobs arrive on-line and must be assigned to one of m machines thereby increasing the load on that machine by a certain weight. Jobs also depart on-line. The goal is to minimize the maximum load on any machine, the load being defined as the sum of the weights of the jobs assigned to the machine. The scheduler has also the option of preempting a job and reassigning it to another machine. Whenever a job is assigned or reassigned to a machine,... (Update)
Context of citations to this paper: More
...load is 1. Thus, one must allow reassignments to achieve significant results for this model. Algorithms for this purpose appear in [32, 38, 2, 3]. 7 L p norm In all the previous sections we evaluated the performance of the algorithm by the maximum load. In section we...
.... For instance the machines may be a set of communication channels which have to accommodate requests for bandwidth [1, 2, 3, 4, 5, 6, 9]. In another application the machines represent distributed database platforms and the jobs are programs which access the database. In...
Cited by: More
Constant Factor Bounds for On-line Load Balancing on Related.. - Andrews (Correct)
Load Balancing in Dynamic Structured P2P Systems - Karthik (2004) (Correct)
On-line Load Balancing of Temporary Tasks Revisited - Lam, Ting, To, Wong (2002) (Correct)
Similar documents (at the sentence level):
52.9%: Scheduling Techniques for Packet Routing, Load Balancing and Disk .. - Andrews (1997) (Correct)
13.3%: Scheduling Techniques for Packet Routing, Load - Balancing And Disk (Correct)
Active bibliography (related documents): More All
0.5: Improved Bounds for On-line Load Balancing - Andrews, Goemans, Zhang (1996) (Correct)
0.5: On-line Load Balancing - Yossi Azar (1992) (Correct)
0.1: Non-Omniscient Scheduling - Eric Torng (1994) (Correct)
Similar documents based on text: More All
0.4: Two-Dimensional Gantt Charts and a Scheduling Algorithm of.. - Goemans, Williamson (1999) (Correct)
0.4: Cooperative Facility Location Games - Goemans, Skutella (2000) (Correct)
0.4: Approximation Algorithms for MAX-3-CUT and Other Problems.. - Goemans, Williamson (2001) (Correct)
Related documents from co-citation: More All
4: Competitive routing of virtual circuits with unknown duration - Awerbuch, Azar et al. - 1994
4: Load Balancing for Response Time - Westbrook - 1995
4: The competitiveness of on-line assignments - Azar, Naor et al. - 1992
BibTeX entry: (Update)
M. Andrews, M. Goemans, and L. Zhang. Improved bounds for on-line load balancing. In COCOON96, 1996. http://citeseer.ist.psu.edu/article/andrews96improved.html More
@inproceedings{ andrews96improved,
author = "Andrews and Goemans and Zhang",
title = "Improved Bounds for On-line Load Balancing",
booktitle = "{COCOON}: Annual International Conference on Computing and Combinatorics",
year = "1996",
url = "citeseer.ist.psu.edu/article/andrews96improved.html" }
Citations (may not include all citations):488 Amortized efficiency of list update and paging rules (context) - Sleator, Tarjan - 1985
170 Bounds for certain multiprocessing anomalies (context) - Graham - 1966
109 line load balancing with applications to machine scheduling .. (context) - Aspnes, Azar et al. - 1993
98 New algorithms for an ancient scheduling problem - Bartal, Fiat et al. - 1992
74 line load balancing - Azar, Broder et al. - 1992
70 A better algorithm for an ancient scheduling problem - Karger, Phillips et al. - 1994
69 Competitive routing of virtual circuits with unknown duratio.. - Awerbuch, Azar et al. - 1994
61 The competitiveness of on-line assignments - Azar, Naor et al. - 1992
32 Online load balancing of temporary tasks (context) - Azar, Kalyanasundaram et al. - 1993
31 Online load balancing and network flow - Phillips, Westbrook - 1993
10 Load balancing for response time - Westbrook - 1995
3 Constant factor bounds for on-line load balancing on related.. - Andrews - 1995
Documents on the same site (http://cm.bell-labs.com/cm/ms/who/andrews/pub.html): More
Hardness of Buy-at-Bulk Network Design - Andrews (2004) (Correct)
Automatic Methods for Hiding Latency in High.. - Andrews, Leighton.. (1996) (Correct)
Hardness of the Undirected Congestion Minimization Problem - Andrews, Zhang (2004) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC