Summary: 1
Efficient Reconfiguration of Trees:
A Case Study in Methodical Design of
Nonmasking Fault­Tolerant Programs ?
.5em Anish Arora
Department of Computer Science
The Ohio State University
Columbus, OH, USA 43210
anish@cis.ohio­state.edu
=1cm
Abstract. We illustrate a formal method for the design of nonmasking
fault­tolerant programs, by demonstrating how the method enables us to
effectively design a new and efficient program. Our program maintains
the processes of any given distributed system in a spanning tree, tolerates
any finite number of fail­stop failures and repairs of system processes
and channels, and requires only O(n) time and O(n log n) space to
reconfigure the tree, where n is the number of nonfaulty processes. The
program is, moreover, simple and fully distributed.
Categories and Subject Descriptors
C.2.4 [Computer Communication Systems] Distributed Systems

Source: Arora, Anish - Department of Computer Science and Engineering, Ohio State University

Collections: Computer Technologies and Information Sciences