This paper describes an algorithm which has been used to implement load balancing for the problem-heap paradigm on a distributed system of transputers. The algorithm is relatively simple due to the fact that only local balance is sought. Emphasis is put on the stepwise development of the algorithm. First an abstract algorithm is presented and its safety and liveness properties are proved. Then a concrete, distributed algorithm is shown to correctly implement the abstract one. Experimental results of the transputer implementation are also reported.
CITATION STYLE
Grønning, P., Nielsen, T. Q., & Løvengreen, H. H. (1991). Stepwise development of a distributed load balancing algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 486 LNCS, pp. 151–168). Springer Verlag. https://doi.org/10.1007/3-540-54099-7_11
Mendeley helps you to discover research relevant for your work.