Exploiting Process Lifetime Distributions for Dynamic Load Balancing

Exploiting Process Lifetime Distributions for Dynamic Load Balancing (1996)

by Mor Harchol-balter , Allen B. Downey

Venue:	ACM Transactions on Computer Systems
Citations:	290 - 30 self

Datum	Value	Source
TITLE	Exploiting process lifetime distributions for dynamic load balancing	INFERENCE
AUTHOR NAME	Mor Harchol-balter	SVM HeaderParse 0.1
AUTHOR AFFIL	y; University of California at Berkeley	SVM HeaderParse 0.2
AUTHOR NAME	Allen B. Downey	SVM HeaderParse 0.1
AUTHOR AFFIL	y; University of California at Berkeley	SVM HeaderParse 0.2
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.	SVM HeaderParse 0.1
YEAR	1997	INFERENCE
VENUE	ACM Transactions on Computer Systems	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	13--24	INFERENCE
VOLUME	15	INFERENCE
CITATIONS	40 found	ParsCit 1.0