Implementation Study Tree Computation on of Dynamic Load Balancing Algorithm of Parallel Clusters of Heterogeneous Workstation

The rapid growth of interconnected high performance workstations has produced a new computing paradigm called clustered of workstations computing. In these systems load balance problem is a serious impediment to achieve good performance. The main concern of this paper is the implementation of dynamic load balancing algorithm, asynchronous Round Robin （ARR）, for balancing workload of parallel tree computation depth-first-search algorithm on Cluster of Heterogeneous Workstations （ COW ） Many algorithms in artificial intelligence and other areas of computer science are based on depth first search in implicitty defined trees. For these algorithms a load- balancing scheme is required, which is able to evenly distribute parts of an irregularly shaped tree over the workstations with minimal interprocessor communication and without prior knowledge of the tree＇s shape. For the （ ARR ） algorithm only minimal interprocessor communication is needed when necessary and it runs under the MPI （Message passing interface） that allows parallel execution on heterogeneous SUN cluster of workstation platform. The program code is written in C language and executed under UNIX operating system （Solaris version）.

Implementation Study Tree Computation on of Dynamic Load Balancing Algorithm of Parallel Clusters of Heterogeneous Workstation