Title :
Self-stabilizing max-heap
Author :
Alima, Luc Onana
Author_Institution :
Dept. of Comput. Sci. & Eng., Univ. Catholique de Louvain, Belgium
Abstract :
A self-stabilizing algorithm is proposed for constructing and maintaining a max-heap in a rooted tree network. The presented solution improves the design of Brian Bourgon and Ajoy K. Datta (1995) in three respects. First, our solution stabilizes in O(h) while theirs stabilizes in O(nh). Second, the additional memory needed for synchronizing nodes of the system in our design is O(1) while in theirs, O(log(Max)) additional memory is required where Max2 is a constant greater than the number of nodes of the system. Third, our design needs no global reset unlike theirs
Keywords :
concurrency control; distributed algorithms; software fault tolerance; synchronisation; tree data structures; distributed algorithms; fault tolerance; global reset; memory; rooted tree network; self-stabilizing algorithm; self-stabilizing max-heap; shared memory; synchronization; Algorithm design and analysis; Computer networks; Context modeling; Distributed algorithms; Dynamic programming; Fault tolerant systems; Input variables; Maintenance engineering; Message passing; Sorting;
Conference_Titel :
Self-Stabilizing Systems, 1999. Proceedings. 19th IEEE International Conference on Distributed Computing Systems Workshop on
Conference_Location :
Austin, TX
Print_ISBN :
0-7695-0228-8
DOI :
10.1109/SLFSTB.1999.777492
