Exploiting Process Lifetime Distributions for Dynamic Load Balancing (1996)
| Venue: | ACM Transactions on Computer Systems |
| Citations: | 290 - 30 self |
BibTeX
@ARTICLE{Harchol-balter96exploitingprocess,
author = {Mor Harchol-balter and Allen B. Downey},
title = {Exploiting Process Lifetime Distributions for Dynamic Load Balancing},
journal = {ACM Transactions on Computer Systems},
year = {1996},
volume = {15},
pages = {13--24}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We measure the distribution of lifetimes for UNIX processes and propose a functional form that fits this distribution well. We use this functional form to derive a policy for preemptive migration, and then use a trace-driven simulator to compare our proposed policy with other preemptive migration policies, and with a non-preemptive load balancing strategy. We find that, contrary to previous reports, the performance benefits of preemptive migration are significantly greater than those of non-preemptive migration, even when the memorytransfer cost is high. Using a model of migration costs representative of current systems, we find that preemptive migration reduces the mean delay (queueing and migration) by 35 -- 50%, compared to non-preemptive migration. 1 Introduction Most systems that perform load balancing use remote execution (i.e. non-preemptive migration) based on a priori knowledge of process behavior, often in the form of a list of process names eligible for migration. Althoug...
