Gagan Aggarwal, Rajeev Motwani, An Zhu  Home/Search
Context Related
| stanford.edu/~anzh...lancingjournal.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: stanford.edu/~anzhu/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In the classical load balancing or multiprocessor scheduling problem, we are given a sequence of jobs of varying sizes and are asked to assign each job to one of the m empty processors. A typical objective is to minimize the makespan, which is the load on the heaviest loaded processor. Since in most real world scenarios, the load is a dynamic measure, the initial assignment may not remain optimal over time. Motivated by such considerations in a variety of systems, we formulate the problem of... (Update)
Cited by: More
Load Balancing in Dynamic Structured P2P Systems - Karthik (2004) (Correct)
Active bibliography (related documents): More All
1.8: The Load Rebalancing Problem - Aggarwal, Motwani, Zhu (2003) (Correct)
0.3: A PTAS for Shop Scheduling with Release Dates to.. - Fishkin, Jansen.. (Correct)
0.2: Forwarders vs. Centralized Server: An Evaluation of Two.. - Alouf, Huet, Nain (2002) (Correct)
Similar documents based on text: More All
0.4: Switch Scheduling via Randomized Edge Coloring - Rajeev (Correct)
0.1: Finding Longest Increasing and Common Subsequences in.. - Liben-Nowell, Vee, Zhu (2003) (Correct)
0.1: Concurrent Rebalancing on HyperRed-Black Trees - Gabarro, Messeguer, Riu (1997) (Correct)
BibTeX entry: (Update)
G. Aggarwal, R. Motwani, and A. Zhu, "The Load Rebalancing Problem," in Proc. ACM SPAA, 2003. http://citeseer.ist.psu.edu/article/aggarwal03load.html More
@misc{ aggarwal03load,
author = "G. Aggarwal and R. Motwani and A. Zhu",
title = "The Load Rebalancing Problem",
text = "G. Aggarwal, R. Motwani, and A. Zhu, The Load Rebalancing Problem, in Proc.
ACM SPAA, 2003.",
year = "2003",
url = "citeseer.ist.psu.edu/article/aggarwal03load.html" }
Citations (may not include all citations):170 Bounds for certain multiprocessing anomalies (context) - Graham - 1966
87 Approximation Algorithms for Scheduling Unrelated Parallel M.. (context) - Lenstra, Shmoys et al. - 1990
77 An approximation algorithm for the generalized assignment pr.. (context) - Shmoys, Tardos - 1993
76 The limited performance benefits of migrating active process.. (context) - Lazowska, Eager et al. - 1998
64 Exploiting process lifetime distributions for dynamic load b.. (context) - Harchol-Balter, Downey - 1997
52 A simple load balancing scheme for task allocation in parall.. - Rudolph, Slivkin-Allalouf et al. - 1991
35 Tight analyses of two local load balancing algorithms - Ghosh, Leighton et al. - 1995
23 An optimal migration algorithm for dynamic load balancing (context) - Hu, Blake et al. - 1998
18 A PTAS for the Multiple Knapsack Problem - Chekuri, Khanna - 2001
10 Improved Approximation Schemes for Scheduling Unrelated Para.. - Jansen, Porkolab - 1999
4 A brief summary of systems providing process or object migra.. (context) - Nuttall - 1994
3 Grouping techniques for scheduling problems: simpler and fas.. - Fishkin, Jansen et al. - 2001
2 Randomized Approximation Schemes for Scheduling Unrelated Pa.. - Efraimidis, Spirakis - 2000
2 Website Migration Load Balancing of Web Servers (context) - Linder, Shah
Documents on the same site (http://theory.stanford.edu/~anzhu/): More
Modeling Correlations in Web-Traces and Implications .. - Psounis, Zhu.. (2004) (Correct)
Approximation Algorithms for Data Placement on.. - Golubchik, Khanna.. (2000) (Correct)
Combining Request Scheduling with Web Caching - Feder, Motwani, Panigrahy.. (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