Parallel computing in combinatorial optimization

This is a review of the literature on parallel computers and algorithms that is relevant for combinatorial optimization. We start by describing theoretical as well as realistic machine models for parallel computations. Next, we deal with the complexity theory for parallel computations and illustrate the resulting concepts by presenting a number of polylog parallel algorithms andP-completeness results. Finally, we discuss the use of parallelism in enumerative methods.

[1]  David S. Johnson.  The NP-Completeness Column: An Ongoing Guide , 1986, J. Algorithms.

[2]  Alan P. Sprague,et al.  Performance of parallel branch-and-bound algorithms , 1985, IEEE Transactions on Computers.

[3]  Kurt Mehlhorn,et al.  Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones , 1986, SIAM J. Comput..

[4]  Sartaj Sahni,et al.  Binary Trees and Parallel Scheduling Algorithms , 1983, IEEE Trans. Computers.

[5]  Howard Jay Siegel,et al.  A Model of SIMD Machines and a Comparison of Various Interconnection Networks , 1979, IEEE Transactions on Computers.

[6]  Franco P. Preparata,et al.  The cube-connected-cycles: A versatile network for parallel computation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[7]  Joseph Y.-T. Leung,et al.  An Optimal Solution for the Channel-Assignment Problem , 1979, IEEE Transactions on Computers.

[8]  László Lovász,et al.  On determinants, matchings, and random algorithms , 1979, FCT.

[9]  J. Lenstra,et al.  Job-Shop Scheduling by Implicit Enumeration , 1977 .

[10]  R. Bellman.  Dynamic programming. , 1957, Science.

[11]  R. Ladner.  The circuit value problem is log space complete for P , 1975, SIGA.

[12]  Donald B. Johnson,et al.  Parallel algorithms for minimum cuts and maximum flows in planar networks , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[13]  R. Larson,et al.  Dynamic programming and parallel computers , 1973 .

[14]  Chris R. Jesshope,et al.  Parallel Computers 2: Architecture, Programming and Algorithms , 1981 .

[15]  Howard Jay Siegel,et al.  Analysis Techniques for SIMD Machine Interconnection Networks and the Effects of Processor Address Masks , 1977, IEEE Transactions on Computers.

[16]  Sartaj Sahni,et al.  Parallel Matrix and Graph Algorithms , 1981, SIAM J. Comput..

[17]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[18]  Harold S. Stone,et al.  Parallel Processing with the Perfect Shuffle , 1971, IEEE Transactions on Computers.

[19]  A. Ghouila-Houri,et al.  Programmes, jeux et réseaux de transport , 1963 .

[20]  Eli Upfal,et al.  Constructing a perfect matching is in random NC , 1985, STOC '85.

[21]  Richard J. Lipton,et al.  Linear Programming is Log-Space Hard for P , 1979, Inf. Process. Lett..

[22]  Kurt Mehlhorn,et al.  Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones , 1987, SIAM J. Comput..

[23]  Stuart E. Dreyfus,et al.  Applied Dynamic Programming , 1965 .

[24]  David E. Muller,et al.  Bounds to Complexities of Networks for Sorting and for Switching , 1975, JACM.

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

[26]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[27]  Eli Upfal,et al.  Parallel hashing: an efficient implementation of shared memory , 1988, JACM.

[28]  Teofilo F. Gonzalez,et al.  Preemptive Scheduling of Uniform Processor Systems , 1978, JACM.

[29]  Jon Louis Bentley,et al.  A Parallel Algorithm for Constructing Minimum Spanning Trees , 1980, J. Algorithms.

[30]  Sartaj Sahni,et al.  Parallel Scheduling Algorithms , 1983, Oper. Res..

[31]  Charles U. Martel.  A Parallel Algorithm for Preemptive Scheduling of Uniform Machines , 1988, J. Parallel Distributed Comput..

[32]  Benjamin W. Wah,et al.  Coping with Anomalies in Parallel Branch-and-Bound Algorithms , 1986, IEEE Transactions on Computers.

[33]  L. Goldschlager.  The monotone and planar circuit value problems are log space complete for P , 1977, SIGA.

[34]  S. H. Unger,et al.  A Computer Oriented toward Spatial Problems , 1899, Proceedings of the IRE.

[35]  Richard M. Karp,et al.  Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[36]  L. Csanky,et al.  Fast Parallel Matrix Inversion Algorithms , 1976, SIAM J. Comput..

[37]  Baruch Awerbuch,et al.  Finding euler circuits in logarithmic parallel time , 1984, STOC '84.

[38]  Ian Watson,et al.  The Manchester prototype dataflow computer , 1985, CACM.

[39]  Eli Upfal,et al.  Parallel hashing: an efficient implementation of shared memory , 1988, JACM.

[40]  H.W.J.M. Trienekens.  Parallel branch and bound on an MIMD system , 1986 .

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

[42]  P. van Emde Boas.  The second machine class: models of parallelism , 1985 .

[43]  Alan P. Sprague,et al.  A Note on Anomalies in Parallel Branch-and-Bound Algorithms with One-to-One Bounding Functions , 1986, Inf. Process. Lett..

[44]  L. Khachiyan.  Polynomial algorithms in linear programming , 1980 .

[45]  Robert McNaughton,et al.  Scheduling with Deadlines and Loss Functions , 1959 .

[46]  Jan Karel Lenstra,et al.  An introduction to parallelism in combinatorial optimization , 1986, Discret. Appl. Math..

[47]  Michael J. Flynn,et al.  Very high-speed computing systems , 1966 .

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

[49]  Harry W. J. M. Trienekens,et al.  Experiments with Parallel Algorithms for Combinatorial Problems , 1985 .

[50]  Evi Nemeth,et al.  DPUP: A Distributed Processing Utilities Package ; CU-CS-337-86 , 1986 .

[51]  Jon S. Squire,et al.  Programming and design considerations of a highly parallel computer , 1963, AFIPS '63 (Spring).

[52]  Joseph JáJá,et al.  Fast, Efficient Parallel Algorithms for Some Graph Problems , 1981, SIAM J. Comput..

[53]  Eugene L. Lawler,et al.  The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization , 1985 .

[54]  E. Szemerédi,et al.  Sorting inc logn parallel steps , 1983 .

[55]  Stephen A. Cook,et al.  An Observation on Time-Storage Trade Off , 1974, J. Comput. Syst. Sci..

[56]  John Staples,et al.  The Maximum Flow Problem is Log Space Complete for P , 1982, Theor. Comput. Sci..

[57]  Eli Upfal,et al.  A probabilistic relation between desirable and feasible, models of parallel computation , 1984, STOC '84.

[58]  Wing H. Huen,et al.  Distributed Enumeration on Between Computers , 1980, IEEE Transactions on Computers.