ACM Home Page
Please provide us with feedback. Feedback
Byzantine generals in action: implementing fail-stop processors
Full text PdfPdf (665 KB)
Source ACM Transactions on Computer Systems (TOCS) archive
Volume 2 ,  Issue 2  (May 1984) table of contents
Pages: 145 - 154  
Year of Publication: 1984
ISSN:0734-2071
Author
Fred B. Schneider  Department of Computer Science, Cornell University, Ithaca, NY
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 63,   Citation Count: 31
Additional Information:

references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/190.357399
What is a DOI?

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
DOLEV, D. The Byzantine Generals strike again. J. Algorithms 3, (1982), 14-30.
 
2
FISCHER, M., AND LYNCH, N. A lower bound for the time to assure interactive consistency. Inf. Process. Lett. 14, 4, (1982), 182-186.
 
3
HALPERN, J., SIMONS, B., AND STRONG, R. An efficient fault-tolerant algorithm for clock synchronization. IBM Research Rep. RJ 4094, IBM, San Jose, Calif., Nov. 1983.
 
4
KATZMAN, J.A. A fault-tolerant computing system. In Proceedings of the 11th Hawaii International Conference on System Sciences, 1978.
5
 
6
LAMPORT, L. The implementation of reliable distributed multiprocess systems. Comput. Networks 2 {1978), 95-114.
7
8
 
9
 
10
LYNCH, N.A., FISCHER, M.J., AND FOWLER, R. A simple and efficient Byzantine Generals algorithm. Tech. Rep. GIT-ICS-82/02, School of Information and Computer Science, Georgia Institute of Technology, Atlanta, Georgia, Feb. 1982.
11
12
13

CITED BY  31
 
 
 
 
 
 
 
 
 
 
 


Peer to Peer - Readers of this Article have also read: