Optimal load balancing and scheduling in a distributed computer system
Journal of the ACM (JACM)
Explicit solutions to the N-queens problem for all N
ACM SIGART Bulletin
Parallel and Distributed Computing: A Survey of Models, Paradigms and Approaches
Parallel and Distributed Computing: A Survey of Models, Paradigms and Approaches
MPI: The Complete Reference
Fundamentals of Parallel Processing
Fundamentals of Parallel Processing
Improved Strategies for Dynamic Load Balancing
IEEE Concurrency
A Practical Approach to Dynamic Load Balancing
IEEE Transactions on Parallel and Distributed Systems
Sourcebook of parallel computing
Sourcebook of parallel computing
| Hi-index | 0.00 |
This paper discusses the dynamic and static balancing of non-homogenous cluster architectures, simultaneously analyzing the theoretical parallel speedup as well as the speedup experimentally obtained. A classical application (Parallel N-Queens) with a parallel solution algorithm, where processing predominates upon communication, has been chosen so as to go deep in the load balancing aspects (dynamic or static) without distortion of results caused by communication overhead. Four interconnected clusters have been used in which the machines within each cluster have homogeneous processors although different among clusters. Thus, the set can be seen as a N-processor heterogeneous cluster or as a multi-cluster scheme with 4 subsets of homogeneous processors. At the same time, three forms of load distribution in the processors (Direct Static, Predictive Static and Dynamic by Demand) have been studied, analyzing in each case parallel speedup and load unbalancing regarding problem size and the processors used.