Asynchronous approximate agreement in partially connected networks

International Journal of Parallel and Distributed Systems and Networks

Volumn 5, Issue 1, 2002, Pages 26-32

  Azadmanesh, M H ^a   Kieckhafer, R M ^a  

^a UNIVERSITY OF NEBRASKA AT OMAHA   (United States)

Author keywords

Approximate agreement; Byzantine agreement; Clock synchronization; Convergent voting algorithms; Fault tolerant multiprocessors; Hybrid fault models

Indexed keywords

ASYNCHRONOUS TRANSFER MODE; DATA COMMUNICATION SYSTEMS; FAULT TOLERANT COMPUTER SYSTEMS; INTERCONNECTION NETWORKS; PARALLEL ALGORITHMS;

APPROXIMATE AGREEMENT; BYZANTINE AGREEMENT; CLOCK SYNCHRONIZATION; CONVERGENT VOTING ALGORITHM; FAULT-TOLERANT MULTIPROCESSOR; HYBRID FAULT MODEL;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0036305779     PISSN: 12062138     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (21)

1. The MAFT architecture for distributed fault-tolerance
2. Synchronizing clocks in the presence of faults
3. A new fault-tolerant algorithm for clock synchronization
4. Reaching approximate agreement in the presence of faults
5. Reaching approximate agreement with mixed mode faults
6. Low cost approximate agreement in partially connected networks
7. Synchronization of fault tolerant clocks in the presence of malicious failures
8. Design of fault tolerant clocks with realistic assumptions
9. Consensus with dual failure modes
10. Interactive consistency with multiple failure modes
11. The formal verification of an algorithm for interactive consistency under a hybrid fault model
12. Fault classification and distribution effects on the reliability modeling of large fault tolerant systems
13. Continual on line diagnosis of hybrid faults
14. Egocentric voting algorithms
15. A formally verified algorithm for clock synchronization under a hybrid fault model
16. Approximate agreement with mixed mode faults: Algorithm and lower bound
17. Exploiting omissive faults in synchronous approximate agreement
18. Network convergence in the presence of omission faults
19. A step toward global convergence in partially connected networks