Sorting and election in anonymous asynchronous rings

Abstract

In an anonymous ring of n processors, all processors are totally indistinguishable except for their input values. These values are not necessarily distinct, i.e., they form a multiset, and this makes many problems particularly difficult. We consider the problem of distributively sorting such a multiset on the ring, and we give a complete characterization of… (More)
DOI: 10.1016/j.jpdc.2003.11.007

Topics

3 Figures and Tables

Statistics

02040201520162017
Citations per Year

Citation Velocity: 11

Averaging 11 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.

Slides referencing similar topics