Computational experiments with an asynchronous parallel branch and bound algorithm

textabstractIn this paper we present an asynchronous branch and bound algorithm for execution on an MIMD system, state sufficient conditions to prevent the parallelism from degrading the performance of this algorithm, and investigate the consequences of having the algorithm executed by nonhomogeneous processing elements. 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 processor utilization are not adequate for fully characterizing the actual execution of an asynchronous parallel branch and bound algorithm. Finally we present some computational results obtained for the symmetric traveling salesman problem.

[1]  H. Trienekens.  Parallel branch and bound and anomalies , 1989 .

[2]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[3]  Jan Karel Lenstra,et al.  Parallel computing in combinatorial optimization , 1988 .

[4]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[5]  R. Jonker,et al.  A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation , 1982 .

[6]  Gregory R. Andrews,et al.  Concepts and Notations for Concurrent Programming , 1983, CSUR.

[7]  Timothy J Gardner,et al.  DPUP: a distributed processing utilities package , 1986, SGNM.

[8]  T. Ibaraki.  ON THE COMPUTATIONAL EFFICIENCY OF BRANCH-AND-BOUND ALGORITHMS , 1977 .

[9]  Alexander H. G. Rinnooy Kan,et al.  A simulation tool for the performance evaluation of parallel branch and bound algorithms , 1988, Math. Program..

[10]  Sartaj Sahni,et al.  Anomalies in Parallel Branch-and-Bound Algorithms , 1984 .

[11]  Richard J. Anderson,et al.  Parallelism and greedy algorithms , 1984 .

[12]  Brian W. Kernighan,et al.  The C Programming Language , 1978 .

[13]  L. G. Mitten.  Branch-and-Bound Methods: General Formulation and Properties , 1970, Oper. Res..

[14]  Jan Karel Lenstra,et al.  BRANCHING FROM THE LARGEST UPPER BOUND: FOLKLORE AND FACTS , 1978 .

[15]  Leslie M. Goldschlager,et al.  A universal interconnection pattern for parallel computers , 1982, JACM.

[16]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .