## On-line Load Balancing (1992)

### Cached

### Download Links

- [www.math.tau.ac.il]
- [www.math.tau.ac.il]
- [www.math.tau.ac.il]
- DBLP

### Other Repositories/Bibliography

Venue: | Theoretical Computer Science |

Citations: | 99 - 15 self |

### BibTeX

@INPROCEEDINGS{Azar92on-lineload,

author = {Yossi Azar},

title = {On-line Load Balancing},

booktitle = {Theoretical Computer Science},

year = {1992},

pages = {218--225},

publisher = {Springer}

}

### Years of Citing Articles

### OpenURL

### Abstract

. We survey on-line load balancing on various models. 1 Introduction General: The machine load balancing problem is defined as follows: There are n parallel machines and a number of independent tasks (jobs); the tasks arrive at arbitrary times, where each task has an associated load vector and duration. A task has to be assigned immediately to exactly one of the machines, thereby increasing the load on this machine by the amount specified by the corresponding coordinate of the load vector for the duration of the task. All tasks must be assigned, i.e., no admission control is allowed. The goal is usually to minimize the maximumload, but we also consider other goal functions. We mainly consider non-preemptive load balancing, but in some cases we may allow preemption i.e., reassignments of tasks. All the decisions are made by a centralized controller. The online load balancing problem naturally arises in many applications involving allocation of resources. As a simple concrete example,...