A logarithmic time sort for linear size networks
Journal Article
·
· J. Assoc. Comput. Mach.; (United States)
A randomized algorithm that sorts on an N node network with constant valence in O(log N) time is given. More particularly, the algorithm sorts N items on an N-node cube-connected cycles graph, and, for some constant kappa, for all large enough ..cap alpha.., it terminates within kappa..cap alpha.. log N time probability at least 1 - N/sup -..cap alpha../.
- Research Organization:
- Harvard Univ., Cambridge, MA
- OSTI ID:
- 6560601
- Journal Information:
- J. Assoc. Comput. Mach.; (United States), Journal Name: J. Assoc. Comput. Mach.; (United States) Vol. 34:1; ISSN JACOA
- Country of Publication:
- United States
- Language:
- English
Similar Records
Optimal parallel merging and sorting without memory conflicts
Parallel permutation and sorting algorithms and a new generalized connection network
Parallel sorting in a ring network of processors
Journal Article
·
Sat Oct 31 23:00:00 EST 1987
· IEEE Trans. Comput.; (United States)
·
OSTI ID:5912451
Parallel permutation and sorting algorithms and a new generalized connection network
Journal Article
·
Thu Jul 01 00:00:00 EDT 1982
· J. Assoc. Comput. Mach.; (United States)
·
OSTI ID:5001068
Parallel sorting in a ring network of processors
Journal Article
·
Tue Feb 28 23:00:00 EST 1989
· IEEE Trans. Comput.; (United States)
·
OSTI ID:6243196