A logarithmic time sort for linear size networks

Authors:
John H. Reif;Leslie G. Valiant
Affiliations:
-;-
Venue:
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Year:
1983

Citing 5
Cited 14

Parallel permutation and sorting algorithms and a new generalized connection network

Journal of the ACM (JACM)
The cube-connected cycles: a versatile network for parallel computation

Communications of the ACM
Universal schemes for parallel communication

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Efficient schemes for parallel communication

PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Randomized parallel communication (Preliminary Version)

PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing

Efficient Schemes for Parallel Communication

Journal of the ACM (JACM)
Parallel hashing—an efficient implementation of shared memory

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Optimal communication algorithms for regular decompositions on the hypercube

C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
The periodic balanced sorting network

Journal of the ACM (JACM)
Sorting with Linear Speedup on a Pipelined Hypercube

IEEE Transactions on Computers
Optimal routing of parentheses on the hypercube

SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Parallel hashing: an efficient implementation of shared memory

Journal of the ACM (JACM)
An Out-of-Core Sorting Algorithm for Clusters with Processors at Different Speed

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
The balanced sorting network

PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Tight bounds on the complexity of parallel sorting

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Randomized speed-ups in parallel computation

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
The VLSI Complexity of Sorting

IEEE Transactions on Computers
Methods for partitioning data to improve parallel execution time for sorting on heterogeneous clusters

GPC'06 Proceedings of the First international conference on Advances in Grid and Pervasive Computing
More efficient parallel integer sorting

FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management

Quantified Score

Hi-index	0.02

Visualization

Abstract

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;.