Abstract

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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.