THE GREEDY LOAD SHARING ALGORITHM

Adaptive load sharing algorithms improve the performance of a distributed system considerably. In this paper we propose an algorithm, the Greedy algorithm, that yields good performance using minimal information about the system. An algorithm known as the Threshold algorithm also yields good performance using as much system information as the Greedy algorithm. We present the results of statistical experiments comparing the Greedy algorithm with the Threshold algorithm and conclude that the Greedy algorithm is an attractive alternative to the Threshold algorithm. © 1990.