ACM Home Page
Please provide us with feedback. Feedback
Revisiting fault diagnosis agreement in a new territory
Full text PdfPdf (1.82 MB)
Source ACM SIGOPS Operating Systems Review archive
Volume 38 ,  Issue 2  (April 2004) table of contents
Pages: 41 - 61  
Year of Publication: 2004
ISSN:0163-5980
Authors
S. C. Wang  Chaoyang University of Technology, Wufeng, Taichung County, Taiwan, R.O.C.
K. Q. Yan  Chaoyang University of Technology, Wufeng, Taichung County, Taiwan, R.O.C.
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 9,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/991130.991134
What is a DOI?

ABSTRACT

In convention, to consensus has been discussed variously. The way of fault masking is commonly used to reach consensus. However, reaching consensus is not enough in a high reliability application. Therefore, in this study, the fault diagnosis agreement is visited. The proposed protocol does not only reach an agreement for healthy processors but also detect and locate the faulty components in a synchronous unreliable network. We also enlarge the fault tolerance capability by allowing both dormant faults and malicious faults exist in a network. That is, the proposed protocol can tolerate, detect and locate the maximum number of faulty components with the dual failure mode to solve the consensus problem and fault diagnosis agreement problem in a synchronous distributed environment by minimum number of rounds of message exchange.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
 
3
 
4
D. Dolev (1982). The Byzantine Generals Strike Again. Journal of Algorithms, 3(1), 14--30.
 
5
Skeen, D., and Stonebraker, M (1983). A Formal Model of Crash Recovery in a Distributed System. IEEE Trans. Software Engineering, 9(4), 219--228.
6
 
7
 
8
D. K. Gifford (1979). Weighted Voting for Replicated Data. Technical Report. CSL-79-14, XEROX Palo Alto Research Center.
 
9
10
 
11
 
12
F. Preparata, G. Metze, and R. Chien (1967). On the Connection Assignment Problem of Diagnosable Systems. IEEE Trans. on Electronic Computing, 16, 848--858.
13
 
14
K. V. S. Ramarao and J. C. Adams (1988). On the Diagnosis of Byzantine Faults. In Proc. of Reliable Distributed Systems. pp. 144--153.
 
15
 
16
 
17
K. Shin and P. Ramanathan (1987). Diagnosis of Processors with Byzantine Faults in a Distributed Computing System. In the Proc. of Fault-Tolerant Computing, pp. 55--60.
 
18
J. H. Wesley, et al, (1978). SIFT: Design and Analysis of a Fault-Tolerant Computer for Aircraft Control. In the Proc. of IEEE 66(10), pp. 1240--1255.
 
19
S. C. Wang, Y. H. Chin, and K. Q. Yan (1990). Reaching a Fault Detection Agreement. In the Proc. of Int'l Conference Parallel Processing, pp. 251--258.
 
20
 
21
 
22
S. C. Wang, K. Q. Yan, S. H. Kao and L. Y. Tseng (2000). Consensus with Dual Link Failure Modes on a Generalized Network. CY Journal, 35--52.
 
23
K. Q. Yan and Y. H. Chin (1988). An Optimal Solution for Consensus Problem in an Unreliable Communication System. In the Proc. of the Int'l Conf. Parallel Processing, pp. 388--391.
 
24