Applying parallel computation algorithms in the design of serial algorithms

The goal of this paper is to point out that analyses of parallelism in computational problems have practical implications even when multi-processor machines are not available. This is true because, in many cases, a good parallel algorithm for one problem may turn out to be useful for designing an efficient serial algorithm for another problem. A unified framework for cases like this is presented. Particular cases, which are discussed in this paper, provide motivation for examining parallelism in problems like sorting, selection, minimum-spanning-tree, shortest route, maxflow, matrix multiplication, as well as scheduling and locational problems.

[1]  K. B. Haley,et al.  Programming, Games and Transportation Networks , 1966 .

[2]  G. Dantzig,et al.  FINDING A CYCLE IN A GRAPH WITH MINIMUM COST TO TIME RATIO WITH APPLICATION TO A SHIP ROUTING PROBLEM , 1966 .

[3]  Claude Berge,et al.  Programming, Games and Transportation Networks , 1966 .

[4]  N. S. Barnett,et al.  Private communication , 1969 .

[5]  E. A. Dinic.  Algorithm for solution of a problem of maximal flow in a network with power estimation , 1970 .

[6]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[7]  A. V. Karzanov,et al.  Determining the maximal flow in a network by the method of preflows , 1974 .

[8]  Leslie G. Valiant,et al.  Parallelism in Comparison Problems , 1975, SIAM J. Comput..

[9]  Gideon Yuval,et al.  An Algorithm for Finding All Shortest Paths Using N^(2.81) Infinite-Precision Multiplications , 1976, Inf. Process. Lett..

[10]  Robert E. Tarjan,et al.  Finding Minimum Spanning Trees , 1976, SIAM J. Comput..

[11]  Ramaswamy Chandrasekaran,et al.  Minimal ratio spanning trees , 1977, Networks.

[12]  S. N. Maheshwari,et al.  An O(|V|³) Algorithm for Finding Maximum Flows in Networks , 1978, Inf. Process. Lett..

[13]  Nimrod Megiddo,et al.  Combinatorial optimization with rational objective functions , 1978, Math. Oper. Res..

[14]  Richard M. Karp,et al.  A characterization of the minimum cycle mean in a digraph , 1978, Discret. Math..

[15]  Franco P. Preparata,et al.  New Parallel-Sorting Schemes , 1978, IEEE Transactions on Computers.

[16]  Zvi Galil,et al.  A Fast Selection Algorithm and the Problem of Optimum Distribution of Effort , 1979, JACM.

[17]  Nimrod Megiddo.  Combinatorial Optimization with Rational Objective Functions , 1979, Math. Oper. Res..

[18]  D. Sleator.  An 0 (nm log n) algorithm for maximum network flow , 1980 .

[19]  Daniel Mier Gusfield.  Sensitivity analysis for combinatorial optimization , 1980 .

[20]  Donald B. Johnson,et al.  Generating and Searching Sets Induced by Networks , 1980, ICALP.

[21]  Toshihide Ibaraki,et al.  An Algorithm for Finding K Minimum Spanning Trees , 1981, SIAM J. Comput..

[22]  Uzi Vishkin,et al.  Finding the maximum, merging and sorting in a parallel computation model , 1981, CONPAR.

[23]  Uzi Vishkin,et al.  Finding the Maximum, Merging, and Sorting in a Parallel Computation Model , 1981, J. Algorithms.

[24]  R. Chandrasekaran,et al.  Location on Tree Networks: P-Centre and n-Dispersion Problems , 1981, Math. Oper. Res..

[25]  Stephen R. Schach,et al.  Max-Min Tree Partitioning , 1981, JACM.

[26]  Nimrod Megiddo.  Applying Parallel Computation Algorithms in the Design of Serial Algorithms , 1981, FOCS.

[27]  Nimrod Megiddo,et al.  An O(n log2 n) Algorithm for the k-th Longest Path in a Tree with Applications to Location Problems , 1981, SIAM J. Comput..

[28]  H. Ishii,et al.  WEIGHTED MINIMAX REAL-VALUED FLOWS , 1981 .

[29]  Uzi Vishkin,et al.  An O(n² log n) Parallel MAX-FLOW Algorithm , 1982, J. Algorithms.

[30]  Allan Borodin,et al.  Routing, merging and sorting on parallel models of computation , 1982, STOC '82.

[31]  Stephen R. Schach,et al.  A Shifting Algorithm for Min-Max Tree Partitioning , 1980, JACM.

[32]  Uzi Vishkin,et al.  An O(log n) Parallel Connectivity Algorithm , 1982, J. Algorithms.

[33]  N. Megiddo,et al.  Finding Least-Distances Lines , 1983 .

[34]  Dan Gusfield,et al.  Parametric Combinatorial Computing and a Problem of Program Module Distribution , 1983, JACM.

[35]  Nimrod Megiddo,et al.  Towards a Genuinely Polynomial Algorithm for Linear Programming , 1983, SIAM J. Comput..

[36]  Nimrod Megiddo,et al.  New Results on the Complexity of p-Center Problems , 1983, SIAM J. Comput..

[37]  Nimrod Megiddo,et al.  The Weighted Euclidean 1-Center Problem , 1983, Math. Oper. Res..