Designing efficient algorithms for parallel computers
Designing efficient algorithms for parallel computers
Introduction to the Design and Analysis of Algorithms
Introduction to the Design and Analysis of Algorithms
What have we learnt from using real parallel machines to solve real problems?
C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
Branch-and-bound algorithms on a hypercube
C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
Hi-index | 0.00 |
This paper presents a load-balancing scheme for a parallel branch and bound (PBB) algorithm utilizing a dynamic load balancer (DLB). The PBB algorithm is used to solve a resource scheduling problem on the Hypercube. The DLB is included in the PBB algorithm and is distributed to each node to balance the workload during run time. The DLB is evaluated by implementing two PBB algorithms, with DLB and without DLB. Results show that the PBB with DLB is 3.14 times faster than the algorithm without DLB.