Brief Announcement: Sorting on Skip Chains

  • Ajoy K. Datta
  • Stéphane Devismes
  • Lawrence L. Larmore
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6976)


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.


Chain Network Major Process Sorting Algorithm Node Store Intermediate Process 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    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)CrossRefzbMATHGoogle Scholar
  2. 2.
    Sasaki, A.: A time-optimal distributed sorting algorithm on a line network. Information Processing Letters 83, 21–26 (2002)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Ajoy K. Datta
    • 1
  • Stéphane Devismes
    • 2
  • Lawrence L. Larmore
    • 1
  1. 1.School of Computer ScienceUniversity of NevadaLas VegasUSA
  2. 2.VERIMAG UMR 5104Université Joseph FourierFrance

Personalised recommendations