By Topic

Self-stabilizing max-heap

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
L. O. Alima ; Dept. of Comput. Sci. & Eng., Univ. Catholique de Louvain, Belgium

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

Published in:

Self-Stabilizing Systems, 1999. Proceedings. 19th IEEE International Conference on Distributed Computing Systems Workshop on

Date of Conference: