Objects shared by Byzantine processes
Publication
, Journal Article
Malkhi, D; Merritt, M; Reiter, MK; Taubenfeld, G
Published in: Distributed Computing
February 1, 2003
Work to date on algorithms for message-passing systems has explored a wide variety of types of faults, but corresponding work on shared memory systems has usually assumed that only crash faults are possible. In this work, we explore situations in which processes accessing shared objects can fail arbitrarily (Byzantine faults).
Duke Scholars
Published In
Distributed Computing
DOI
ISSN
0178-2770
Publication Date
February 1, 2003
Volume
16
Issue
1
Start / End Page
37 / 48
Related Subject Headings
- Computation Theory & Mathematics
- 4606 Distributed computing and systems software
- 0805 Distributed Computing
Citation
APA
Chicago
ICMJE
MLA
NLM
Malkhi, D., Merritt, M., Reiter, M. K., & Taubenfeld, G. (2003). Objects shared by Byzantine processes. Distributed Computing, 16(1), 37–48. https://doi.org/10.1007/s00446-002-0075-3
Malkhi, D., M. Merritt, M. K. Reiter, and G. Taubenfeld. “Objects shared by Byzantine processes.” Distributed Computing 16, no. 1 (February 1, 2003): 37–48. https://doi.org/10.1007/s00446-002-0075-3.
Malkhi D, Merritt M, Reiter MK, Taubenfeld G. Objects shared by Byzantine processes. Distributed Computing. 2003 Feb 1;16(1):37–48.
Malkhi, D., et al. “Objects shared by Byzantine processes.” Distributed Computing, vol. 16, no. 1, Feb. 2003, pp. 37–48. Scopus, doi:10.1007/s00446-002-0075-3.
Malkhi D, Merritt M, Reiter MK, Taubenfeld G. Objects shared by Byzantine processes. Distributed Computing. 2003 Feb 1;16(1):37–48.
Published In
Distributed Computing
DOI
ISSN
0178-2770
Publication Date
February 1, 2003
Volume
16
Issue
1
Start / End Page
37 / 48
Related Subject Headings
- Computation Theory & Mathematics
- 4606 Distributed computing and systems software
- 0805 Distributed Computing