| | |
Summary: On the Correctness Criteria of Load Balancing Programs
Anish Arora 1 Mohamed G. Gouda
Computer & Information Science Computer Sciences
The Ohio State University The University of Texas
Columbus, OH 43210 Austin, TX 78712
September 28, 1999
Abstract
Load balancing programs are usually veri ed by analyzing and simulating simple
performance models. In this paper, we argue that besides this veri cation the correct-
ness of load balancing programs needs to be veri ed formally, in order to gain con dence
in the use of these programs in practical situations where the simple models are not
always respected. Towards this end, we propose a set of correctness conditions that
need to be satis ed by load balancing programs. Moreover, we show that these correct-
ness conditions are not unduly restrictive, by designing a rich family of load balancing
programs that satisfy these conditions. The presented programs are distinguished by
their properties of full distribution, scalability, adaptivity, fault-tolerance, and guaran-
teed progress irrespective of the speed at which the environment produces or consumes
load.
Keywords: load balancing programs, veri cation, distribution, constraint, convergence
1 Contact Address: Dreese 395, 2015 Neil Avenue Mall, Columbus, OH 43210, USA
|
