论文信息 - A logarithmic time sort for linear size networks

A logarithmic time sort for linear size networks

We give a randomized algorithm that sorts on an N node network with constant valence in 0(log N) time. More particularly the algorithm sorts N items on an N node cube-connected cycles graph and for some constant k for all large enough &agr; it terminates within k&agr; log N time with probability at least 1−N−&agr;.

Leslie G. Valiant | John H. Reif | L. Valiant | J. Reif

[1] Eli Upfal,et al. Efficient schemes for parallel communication , 1982, PODC '82.

[2] Romas Aleliunas,et al. Randomized parallel communication (Preliminary Version) , 1982, PODC '82.

[3] Sartaj Sahni,et al. Parallel permutation and sorting algorithms and a new generalized connection network , 1982, JACM.

[4] Leslie G. Valiant,et al. A Scheme for Fast Parallel Communication , 1982, SIAM J. Comput..

[5] Rüdiger Reischuk,et al. A fast probabilistic parallel sorting algorithm , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[6] Leslie G. Valiant,et al. Universal schemes for parallel communication , 1981, STOC '81.

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

[8] Leslie G. Valiant,et al. Fast probabilistic algorithms for hamiltonian circuits and matchings , 1977, STOC '77.

[9] Volker Strassen,et al. A Fast Monte-Carlo Test for Primality , 1977, SIAM J. Comput..

[10] J. Spencer. Probabilistic Methods in Combinatorics , 1974 .

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

[12] W. Hoeffding. On the Distribution of the Number of Successes in Independent Trials , 1956 .

[13] H. Chernoff. A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .