Sorting on Skip Chains

Sorting on Skip Chains

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...

Full description

Saved in:
Bibliographic Details
Published in:2011 Second International Conference on Networking and Computing pp. 193 - 199
Main Authors: Datta, A. K., Larmore, L. L., Devismes, S.
Format: Conference Proceeding
Language:English
Published: IEEE 01-11-2011
Subjects:
chain network
Color
distributed algorithm
Distributed algorithms
Error correction
Image color analysis
Process control
Relays
self-stabilization
Sorting
sorting algorithm
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISBN:1457717964
9781457717963
DOI:10.1109/ICNC.2011.36