Effects of Response and Stability on Scheduling in Distributed Computing Systems

An examination is made of the effects of response and stability on scheduling algorithms for general-purpose distributed computing systems. Response characterizes the time required, following a perturbation in the system state, to reach a new equilibrium state. Stability is a measure of the ability of a mechanism to detect when the effects of further actions will not improve the system state as defined by a user-defined objective. These results have implications for distributed computations in general. Analysis is based on formal communicating finite automata models of two distinct approaches to the scheduling problem, each using the objective of global optimal load balancing. The results indicate that absolute stability is not always necessary in dynamic systems for the same reasons that relatively small amounts of instability are tolerated in the design of analog control systems. It is shown that response is a very important first-order metric of dynamic scheduling behavior, and that response and stability are related. >

[1]  Lionel M. Ni,et al.  Nonpreemptive load balancing in a class of local area networks , 1981 .

[2]  Kai Hwang,et al.  Optimal load balancing strategies for a multiple processor system , 1981 .

[3]  Kai Hwang,et al.  Correction to “optimal load balancing in a multiple processor system with many job classes” , 1985, IEEE Transactions on Software Engineering.

[4]  Gerald M. Weinberg,et al.  On the design of stable systems , 1979 .

[5]  Walter H. Kohler,et al.  Models for Dynamic Load Balancing in a Heterogeneous Multiple Processor System , 1979, IEEE Transactions on Computers.

[6]  Thomas L. Casavant,et al.  A Formal Model of Distributed Decision-Making and Its Application to Distributed Load Balancing , 1986, ICDCS.

[7]  Reid G. Smith,et al.  The Contract Net Protocol: High-Level Communication and Control in a Distributed Problem Solver , 1980, IEEE Transactions on Computers.

[8]  John A. Stankovic.  Stability and Distributed Scheduling Algorithms , 1985, IEEE Trans. Software Eng..

[9]  Thomas L. Casavant,et al.  A Taxonomy of Scheduling in General-Purpose Distributed Computing Systems , 1988, IEEE Trans. Software Eng..

[10]  Barton P. Miller,et al.  Process migration in DEMOS/MP , 1983, SOSP '83.

[11]  Raphael A. Finkel,et al.  A Stable Distributed Scheduling Algorithm , 1981, IEEE International Conference on Distributed Computing Systems.

[12]  John A. Stankovic,et al.  Simulations of Three Adaptive, Decentralized Controlled, Job Scheduling Algorithms , 1984, Comput. Networks.

[13]  Jacob A. Abraham,et al.  Load Balancing in Distributed Systems , 1982, IEEE Transactions on Software Engineering.