Self-stabilizing algorithms for sorting and heapification (original) (raw)

2008 IEEE International Symposium on Parallel and Distributed Processing, 2008

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

Doina Bein hasn't uploaded this paper.

Let Doina know you want this paper to be uploaded.

Ask for this paper to be uploaded.