Self-stabilizing max-heap

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.