An introduction to parallelism in combinatorial optimization

Abstract This is a tutorial introduction to the literature on parallel computers and algorithms that is relevant for combinatorial optimization. We briefly discuss theoretical as well as realistic machine models and the complexity theory for parallel computations. Some examples of polylog parallel algorithms and log space completeness results for P are given, and the use of parallelism in enumerative methods is reviewed.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[17]  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).

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

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

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

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

[22]  Donald B. Johnson,et al.  Parallel Algorithms for Minimum Cuts and Maximum Flows in Planar Networks (Preliminary Version) , 1982, FOCS.

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

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

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

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

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

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

[29]  Stephen A. Cook,et al.  An observation on time-storage trade off , 1973, J. Comput. Syst. Sci..

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

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

[32]  H. T. Kung,et al.  Direct VLSI Implementation of Combinatorial Algorithms , 1979 .

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

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

[35]  H. T. Kung,et al.  A tree machine for searching problems , 1979 .

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

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