TY - JOUR
T1 - Sorting on a ring of processors
AU - Mansour, Yishay
AU - Schulman, Leonard
N1 - Funding Information:
*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-DALLO3-86-K-017, DARPA-NOOO14-87-k-85, ONR-NOOO14-86-K-0593, AF-OSR-89-0271, and DAAL-03-86-K-0171
PY - 1990/12
Y1 - 1990/12
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=38249018310&partnerID=8YFLogxK
U2 - 10.1016/0196-6774(90)90012-4
DO - 10.1016/0196-6774(90)90012-4
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:38249018310
VL - 11
SP - 622
EP - 630
JO - Journal of Algorithms
JF - Journal of Algorithms
SN - 0196-6774
IS - 4
ER -