Parallel branch and bound algorithms on hypercube multiprocessors

Authors:
T. S. Abdelrahman;T. N. Mudge
Affiliations:
Advanced Computer Architecture Laboratory, Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI;Advanced Computer Architecture Laboratory, Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI
Venue:
C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
Year:
1989

Citing 3
Cited 4

An upper bound for the speedup of parallel best-bound branch-and-bound algorithm

BIT
The Power of Dominance Relations in Branch-and-Bound Algorithms

Journal of the ACM (JACM)
Parallel processing of best-first branch and bound algorithms on distributed memory multiprocessors

Parallel processing of best-first branch and bound algorithms on distributed memory multiprocessors

High performance hypercube communications

C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
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
An Inherently Parallel Method for Heuristic Problem-Solving: Part I-General Framework

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Branch and Bound (BB) algorithms are a generalization of many search algorithms used in Artificial Intelligence and Operations Research. This paper presents our work on implementing BB algorithms on hypercube multiprocessors. The 0-1 integer linear programming (ILP) problem is taken as an example because it can be implemented to capture the essence of BB search algorithms without too many distracting problem specific details. A BB algorithm for the 0-1 ILP problem is discussed. Two parallel implementations of the algorithm on hypercube multiprocessors are presented. The two implementations demonstrate some of the tradeoffs involved in implementing these algorithms on multiprocessors with no shared memory, such as hypercubes. Experimental results from the NCUBE/six show the performance of the two implementations of the algorithm. Future research work is discussed.