Abstract
Sorting values on a chain of processes is a well-known problem, and a number of algorithms has been published [1,2]. We consider here a generalization of this problem, where the processes that have values, called major processes, are separated from each other by any number of intermediate processes, called relay processes, which do not have their own values, although they can read and write the major values while doing their job of relaying those values.
The full version of this paper is available at tinyurl.com/3dydywq . This work has been partially supported by the ANR project ARESA2.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Flocchini, P., Kranakis, E., Krizanc, D., Luccio, F., Santoro, N.: Sorting and election in anonymous asynchronous rings. Journal of Parallel and Distributed Computing 64, 254–265 (2004)
Sasaki, A.: A time-optimal distributed sorting algorithm on a line network. Information Processing Letters 83, 21–26 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Datta, A.K., Devismes, S., Larmore, L.L. (2011). Brief Announcement: Sorting on Skip Chains. In: Défago, X., Petit, F., Villain, V. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2011. Lecture Notes in Computer Science, vol 6976. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24550-3_38
Download citation
DOI: https://doi.org/10.1007/978-3-642-24550-3_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24549-7
Online ISBN: 978-3-642-24550-3
eBook Packages: Computer ScienceComputer Science (R0)