The Community for Technology Leaders
Parallel and Distributed Processing Symposium, International (2008)
Miami, FL, USA
Apr. 14, 2008 to Apr. 18, 2008
ISBN: 978-1-4244-1693-6
pp: 1-12
Doina Bein , Department of Computer Science, University of Texas at Dallas, 75083, USA
Ajoy K. Datta , School of Computer Science, University of Nevada, Las Vegas, 89154, USA
Lawrence L. Larmore , School of Computer Science, University of Nevada, Las Vegas, 89154, USA
ABSTRACT
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.
INDEX TERMS
CITATION

L. L. Larmore, A. K. Datta and D. Bein, "Self-stabilizing algorithms for sorting and heapification," 2008 IEEE International Parallel & Distributed Processing Symposium(IPDPS), Miami, FL, 2008, pp. 1-12.
doi:10.1109/IPDPS.2008.4536327
95 ms
(Ver 3.3 (11022016))