Self-stabilizing algorithms for sorting and heapification
We present two space and time efficient asynchronous distributed self-stabilizing algorithms. The first sorts an oriented chain network and the second heapifies a rooted tree network. The time complexity of both solutions is linear — in terms of the nodes (for the chain) and height (for the tree). The chain sorting algorithm uses O(m) bits per process where m represents the number of bits required to store any value in the network. The heapify algorithm needs O(m·D) bits per process where D is the degree of the tree.
Datta, A. K.,
Larmore, L. L.
Self-stabilizing algorithms for sorting and heapification.
IEEE International Symposium on Parallel and Distributed Processing, 2008