Load balancing using symmetric broadcast networks: a PVM-based comparative performance study

In parallel and distributed systems, an important issue in managing a decentralized task queue is load balancing among multiple processors. In this paper, we propose a scheme for this problem by using a symmetric broadcast network (SBN) which provides an efficient and robust communication pattern between processors. We compare the performance of SBN-based load balancing algorithm with randomization-based algorithm, gradient algorithm, and extended gradient algorithm on a broad range of computing and communication platforms. All four algorithms were first implemented on an 8-processor Intel´s iPSC-2, a hypercube-based multicomputer. Then, the programs were ported to Parallel Virtual Machine (PVM). Using PVM we compared all four algorithms on (i) an d-processor bus-based Silicon Graphics multiprocessor (SGI), (ii) two DEC´s Alpha workstations connected by a Local Area Network, and (iii) SGI and the two DEC Alpha´s connected by internet. We found that our SBN-based algorithm performed well over a wide range of workloads, and computer and communication configurations