Abstract
AbstractA fault‐tolerant protocol is important in a distributed system consisting of processes that are interconnected in a network. One prominent technique used for implementing fault tolerance is a self‐stabilizing protocol. A self‐stabilizing protocol stabilizes in obtaining a solution regardless of the network status from which execution begins. This property enables a self‐stabilizing protocol to tolerate arbitrary transient faults. This paper uses a self‐stabilizing protocol for implementing interprocess synchronization in a tree network to propose a self‐stabilizing protocol for configuring a heap‐ordered tree. The proposed protocol for configuring the heap‐ordered tree, which has stabilizing time O(h) and space complexity of each process O(K), has improved both the stabilizing time and space complexity compared with other known results (where h is the height of the tree and K is the input size). © 2003 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 86(9): 63–72, 2003; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.10109
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Electronics and Communications in Japan (Part III: Fundamental Electronic Science)
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
