Effects of Response and Stability on Scheduling in Distributed Computing Systems
IEEE Transactions on Software Engineering
The Influence of Different Workload Descriptions on a Heuristic Load Balancing Scheme
IEEE Transactions on Software Engineering
Load-balancing heuristics and process behavior
SIGMETRICS '86/PERFORMANCE '86 Proceedings of the 1986 ACM SIGMETRICS joint international conference on Computer performance modelling, measurement and evaluation
A learning approach to processor allocation in parallel systems
Proceedings of the eighth international conference on Information and knowledge management
IEEE Transactions on Parallel and Distributed Systems
Methodical Analysis of Adaptive Load Sharing Algorithms
IEEE Transactions on Parallel and Distributed Systems
Prediction-Based Dynamic Load-Sharing Heuristics
IEEE Transactions on Parallel and Distributed Systems
An analysis of the optimal number of servers in distributed client/server environments
Decision Support Systems
A physical particle and plane framework for load balancing in multiprocessors
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
| Hi-index | 0.00 |
Many distributed scheduling algorithms have been developed and reported in the current literature. However, very few of them explicitly treat stability issues. This paper first discusses stability issues for distributed scheduling algorithms in general terms. Two very different distributed scheduling algorithms which contain explicit mechanisms for stability are then presented and evaluated with respect to individual specific stability issues. One of the agorithms is based on stochastic learning automata and the other on bidding. The results indicate how very specific the treatment of stability is to the algorithm and environnent under consideration.