Parallel Branch and Bound on an MIMD (Multiple Instruction Stream, Multiple Data Stream) System.
Abstract
This paper gives a classigfication of parallel branch and bound algorithms and develop a class of asynchronous branch and bound algorithms for execution on an MIMD system. We develop sufficient conditions to prevent the anomalies that can occur due to the parallelism, the asynchronicity or the nondeterminism, from degrading the performance of the algorithm. Such conditions were known already for the synchronous case. It turns out that these conditions are sufficient for asynchronous alogrithms as well. We also investigate the consequences of nonhomogeneous processing elements in a parallel computer system. We introduce the notions of perfect parallel time and achieved efficiency to empirically measure the effects of parallelism, because the traditional notions of speedup and efficiency are not capable of fully characterizing the actual execution of an asynchronous parallel algorithm. Finally we present some computational results obtained for the symmetric traveling salesman problem. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Feb 16, 1987
- Accession Number
- ADA178816
Entities
People
- Harry W. Trienekens
Organizations
- University of Colorado Boulder