Sorting on a ring of processors
References (6)
The complexity of sorting on distributed systems
Inform. and Control
(1984)- et al.
Computing on an anonymous ring
J. Assoc. Comput. Mach.
(1988) Tradeoffs for selection in distributed networks
There are more references available in the full text version of this article.
Cited by (5)
Packet Routing in Fixed-Connection Networks: A Survey
1998, Journal of Parallel and Distributed ComputingDistributed Job Scheduling in Rings
1997, Journal of Parallel and Distributed ComputingParallel system interconnections and communications
2000, Parallel System Interconnections and CommunicationsJob scheduling in rings
1994, Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1994Algorithms and Average Time Bounds of Sorting on a Mesh-Connected Computer
1994, IEEE Transactions on Parallel and Distributed Systems
- ∗
Part of the work was done while the first author was visiting Bell Laboratories, Murray Hill, NJ. The second author was supported by an ONR graduate fellowship. The research was supported by NSF-865727-CRR, ARO-DALL03-86-K-017, DARPA-N00014-87-k-85, ONR-N00014-86-K-0593, AF-OSR-89-0271, and DAAL-03-86-K-0171
Copyright © 1990 Published by Elsevier Inc.