|Title:||Load Balancing in a Distributed Shared Memory System
|Authors:||A. Dubrovsky, R. Friedman and A. Schuster
|Abstract:||This paper reports on a comparison of six different algorithms for load balancing in a distributed environment. These algorithms represent different approaches to load balancing, such as dynamic vs. Static, cooperative vs. Non-cooperative, centralized vs. Distributed, and whether threads are allowed to migrate after their initial allocation or not. These algorithms are implemented as part of the PARC-MACH environment for executing parallel programs over a cluster of workstations. All experiments reported in this work have been conducted on this system. The results of these experiments indicate that dynamic distributed algorithms are usually better than static centralized algorithms, although in some cases the latter behave better than the former. As a result of this work, we believe that in distributed environments there is a need for load balancing algorithms that take into account the effect of remote memory access on the performance of the system.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1996/LPCR/LPCR9602), rather than to the URL of the PDF or PS files directly. The latter URLs may change without notice.
To the list of the LPCR technical reports of 1996
To the main CS technical reports page
Computer science department, Technion