Sorting on a ring of processors

Yishay Mansour, Leonard Schulman

Research output: Contribution to journalArticlepeer-review

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[ n 2] - 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 [ n 2] + 1 steps if each processor is allowed to store six values.

Original languageEnglish
Pages (from-to)622-630
Number of pages9
JournalJournal of Algorithms
Volume11
Issue number4
DOIs
StatePublished - Dec 1990
Externally publishedYes

Fingerprint

Dive into the research topics of 'Sorting on a ring of processors'. Together they form a unique fingerprint.

Cite this