Title :
Sorting on Skip Chains
Author :
Datta, Ajoy K. ; Larmore, Lawrence L. ; Devismes, Stéphane
Author_Institution :
Sch. of Comput. Sci., UNLV, Las Vegas, NV, USA
fDate :
Nov. 30 2011-Dec. 2 2011
Abstract :
We introduce a generalization of the distributed sorting problem on chain network. Our problem consists of sorting values in processes that are separated from each other by any number of intermediate processes which can relay values but do not have their own values. We solve this problem in a chain network by proposing a silent self-stabilizing distributed algorithm.
Keywords :
distributed algorithms; network theory (graphs); distributed sorting problem; silent self-stabilizing distributed algorithm; skip chain network; Color; Distributed algorithms; Error correction; Image color analysis; Process control; Relays; Sorting; chain network; distributed algorithm; self-stabilization; sorting algorithm;
Conference_Titel :
Networking and Computing (ICNC), 2011 Second International Conference on
Conference_Location :
Osaka
Print_ISBN :
978-1-4577-1796-3
DOI :
10.1109/ICNC.2011.36
