Simulations of three adaptive, decentralized controlled, job scheduling algorithms
Computer Networks and ISDN Systems
Stability and Distributed Scheduling Algorithms
IEEE Transactions on Software Engineering
A taxonomy of scheduling in general-purpose distributed computing systems
IEEE Transactions on Software Engineering
SOSP '83 Proceedings of the ninth ACM symposium on Operating systems principles
IEEE Transactions on Software Engineering
IEEE Transactions on Parallel and Distributed Systems
ACM Computing Surveys (CSUR)
Methodical Analysis of Adaptive Load Sharing Algorithms
IEEE Transactions on Parallel and Distributed Systems
QoS management in distributed service oriented systems
PDCN'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: parallel and distributed computing and networks
A physical particle and plane framework for load balancing in multiprocessors
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Tasks mapping with quality of service for coarse grain parallel applications
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
A fuzzy grouping-based load balancing for distributed object computing systems
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
| Hi-index | 0.01 |
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.