Affiliation:
1. Harvard Univ., Cambridge, MA
Abstract
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
k
, for all large enough
α
, it terminates within
kα
log
N
time with probability at least 1 -
N
-
α
.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Cited by
118 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. More Efficient Parallel Integer Sorting;International Journal of Foundations of Computer Science;2022-03-24
2. Bibliography;The Art of Multiprocessor Programming;2021
3. Counting, sorting, and distributed coordination;The Art of Multiprocessor Programming;2021
4. Competitive Routing in Hybrid Communication Networks;Algorithms for Sensor Systems;2019
5. A Study of Integer Sorting on Multicores;Parallel Processing Letters;2018-12