Summary: Fault­Tolerant Reconfiguration
of Trees and Rings in Distributed Systems \Lambda
Anish Arora Ashish Singhai
Computer Science Computer Science
The Ohio State University University of Illinois
Columbus, OH 43210 Urbana­Champaign, IL 61801
Abstract
We design two programs that maintain the nodes of any distributed sys­
tem in a rooted spanning tree and in a unidirectional ring, respectively, in
the presence of any finite number of fail­stop failures and repairs of system
nodes and communication channels. Our programs are fully distributed, have
optimal time and space complexity, and illustrate two different methods for
the design of nonmasking fault­tolerant programs.
Categories and Subject Descriptors
C.2.4 [Computer Communication Systems] Distributed Systems
D.1.3 [Programming Techniques] Concurrent Programming
D.2.4 [Program Verification] Reliability
D.2.10 [Program Design] Methodologies
D.4.5 [Operating Systems] Fault­tolerance
G.2.2 [Discrete Mathematics] Graph Algorithms

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

Collections: Computer Technologies and Information Sciences