The Community for Technology Leaders
2011 Second International Conference on Networking and Computing (2011)
Osaka, Japan
Nov. 30, 2011 to Dec. 2, 2011
ISBN: 978-0-7695-4569-1
pp: 193-199
ABSTRACT
We introduce a generalization of the distributed sorting problem on chain network. Our problem consists of sorting values in {\ndes} that are separated from each other by any number of intermediate {\ndes} 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.
INDEX TERMS
chain network, distributed algorithm, self-stabilization, sorting algorithm
CITATION

A. K. Datta, L. L. Larmore and S. Devismes, "Sorting on Skip Chains," 2011 Second International Conference on Networking and Computing(ICNC), Osaka, Japan, 2011, pp. 193-199.
doi:10.1109/ICNC.2011.36
85 ms
(Ver 3.3 (11022016))