Using Omissive Faults to Obtain Local Convergence in Partially Connected Networks

Authors

M. H. Azadmanesh, University of Nebraska at OmahaFollow
A. W. Krings, University of IdahoFollow

Document Type

Article

Publication Date

1999

Publication Title

Transactions of the Nebraska Academy of Sciences

Volume

25

First Page

1

Last Page

13

Abstract

Approximate Agreement is an important issue in faulttolerant distributed computing where non-faulty processes exchange and vote upon their local values, to arrive at values which are within the range of the initial values of the nonfaulty processes and within a predefined tolerance of each other. Results to date in Approximate Agreement, however, are not capable of exploiting omission faults. Omission faults are presumed not to occur or a predefined default value is substituted for those values not received, or they are globally discarded before the voting algorithm executes. As a result, hybrid fault models can not differentiate between omissive and transmissive faults.

Comments

Published in the Transactions of the Nebraska Academy of Sciences, 25: 1-13, 1999. Copyright © 1999 Azadmanesh and Krings.

Recommended Citation

Azadmanesh, M. H. and Krings, A. W., "Using Omissive Faults to Obtain Local Convergence in Partially Connected Networks" (1999). Computer Science Faculty Publications. 1.
https://digitalcommons.unomaha.edu/compscifacpub/1