Elsevier

Journal of Algorithms

Volume 11, Issue 4, December 1990, Pages 622-630
Journal of Algorithms

Sorting on a ring of processors

https://doi.org/10.1016/0196-6774(90)90012-4Get rights and content

Abstract

We study the time necessary to sort on a ring of processors. We show that the amount of space available to each processor determines the time required. We prove a lower bound of 2[n2] − 1 steps for sorting on a ring of n processors, under the constraint that each processor retains only a single value at any time. In contrast, we show an algorithm that sorts in [n2] + 1 steps if each processor is allowed to store six values.

References (6)

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 Computing
  • Distributed Job Scheduling in Rings

    1997, Journal of Parallel and Distributed Computing
  • Parallel system interconnections and communications

    2000, Parallel System Interconnections and Communications
  • Job scheduling in rings

    1994, Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1994
  • Algorithms 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

View full text