CLUSTER OF WORKSTATIONS BASED ON DYNAMIC LOAD BALANCING FOR PARALLEL TREE COMPUTATION DEPTH-FIRST-SEARCH

IntroductionWith the advantages of the high- speed net-works,cluster of workstations achieve the samescalable parallelism as the current MPPs( Massive-ly Parallel Processors) .But there are many factorssuch as load imbalance,synchronization and com-munication that inhibit good performance in thesesystems.These issues are central to the develop-ment of many parallel applications. Load balanceproblem is a serious impediment to achieving goodperformance in parallel processing the issue of load…

CLUSTER OF WORKSTATIONS BASED ON DYNAMIC LOAD BALANCING FOR PARALLEL TREE COMPUTATION DEPTH-FIRST-SEARCH

The real problem in cluster of workstations is the changes in workstation power or number of workstations or dynmaic changes in the run time behavior of the application hamper the efficient use of resources. Dynamic load balancing is a technique for the parallel implementation of problems, which generate unpredictable workloads by migration work units from heavily loaded processor to lightly loaded processors at run time. This paper proposed an efficient load balancing method in which parallel tree computations depth first search (DFS) generates unpredictable, highly imbalance workloads and moves through different phases detectable at run time, where dynamic load balancing strategy is applicable in each phase running under the MPI(message passing interface) and Unix operating system on cluster of workstations parallel platform computing.