Architectural Support for Designing Fault-Tolerant Open Distributed Systems

Authors:
Salim Hariri;Alok Choudhary;Behcet Sarikaya
Affiliations:
-;-;-
Venue:
Computer
Year:
1992

Citing 7
Cited 2

Concurrency control and recovery in database systems

Concurrency control and recovery in database systems
SYREL: A Symbolic Reliability Algorithm Based on Path and Cutset Methods

IEEE Transactions on Computers
Computer networks

Computer networks
Coverage Modeling for Dependability Analysis of Fault-Tolerant Systems

IEEE Transactions on Computers
Fault-Tolerant Computing: Fundamental Concepts

Computer
Fault Tolerance in Commercial Computers

Computer
Reliable broadcast protocols

ACM Transactions on Computer Systems (TOCS)

A novel fault-tolerant scheduling algorithm for precedence constrained tasks in real-time heterogeneous systems

Parallel Computing
A novel fault-tolerant scheduling algorithm for precedence constrained tasks in real-time heterogeneous systems

Parallel Computing

Quantified Score

Hi-index	4.10

Visualization

Abstract

An overview of the main techniques for designing fault-tolerant software and hardware systems is provided. The important features of the building blocks (computers, memories, buses, etc.) that can support an efficient implementation of fault-tolerant open distributed systems (FTODSs) are identified. Taking into account the features of these building blocks, an organization for FTODS is proposed. A distributed voting algorithm and a two-level hierarchy for permanent memory are key elements in this scheme. The algorithms needed for transferring files and synchronizing the concurrent activities of the computing modules and for recovery-are ISO standard protocols. Low-level voting and recovery algorithms that can run as a layer of software above the operating system make the open distributed system an attractive environment for applying fault-tolerant techniques.