论文信息 - Finding the maximum, merging and sorting in a parallel computation model

Finding the maximum, merging and sorting in a parallel computation model

A model for synchronized parallel computation is described in which all p processors have access to a common memory. this model is used to solve the problems of finding the maximum, merging, and sorting by p processors.

Uzi Vishkin | Yossi Shiloach | Y. Shiloach | U. Vishkin

[1] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .

[2] Kenneth E. Batcher,et al. Sorting networks and their applications , 1968, AFIPS Spring Joint Computing Conference.

[3] Shimon Even,et al. Parallelism in tape-sorting , 1974, Commun. ACM.

[4] Fanica Gavril. Merging with parallel processors , 1975, CACM.

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

[6] Shmuel Winograd,et al. On the Parallel Evaluation of Certain Arithmetic Expressions , 1975, JACM.

[7] Derek G. Corneil,et al. Parallel computations in graph theory , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[8] C. Savage. Parallel Algorithms for Graph Theoretic Problems , 1977 .

[9] D. Heller. A Survey of Parallel Algorithms in Numerical Linear Algebra. , 1978 .

[10] Daniel S. Hirschberg. Fast parallel sorting algorithms , 1978, CACM.

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

[12] Dilip V. Sarwate,et al. Computing connected components on parallel computers , 1979, CACM.