Total ordering algorithms

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Total ordering algorithms

Full text

Pdf (562 KB)

Source

ACM Annual Computer Science Conference archive
Proceedings of the 19th annual conference on Computer Science table of contents

San Antonio, Texas, United States

Pages: 375 - 380

Year of Publication: 1991

ISBN:0-89791-382-5

Authors

Louise E. Moser	Departments of Electrical and Computer Engineering and of Computer Science, University of California, Santa Barbara, CA
P. M. Melliar-Smith	Departments of Electrical and Computer Engineering and of Computer Science, University of California, Santa Barbara, CA
Vivek Agrawala	Departments of Electrical and Computer Engineering and of Computer Science, University of California, Santa Barbara, CA

Sponsor

ACM: Association for Computing Machinery

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 19, Citation Count: 2

Additional Information:

references cited by collaborative colleagues

Tools and Actions:	Request Permissions 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/327164.327298 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	Michael Ben-Or, Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols, Proceedings of the second annual ACM symposium on Principles of distributed computing, p.27-30, August 17-19, 1983, Montreal, Quebec, Canada [doi>10.1145/800221.806707]
	2	Ofer Biran , Shlomo Moran , Shmuel Zaks, A combinatorial characterization of the distributed tasks which are solvable in the presence of one faulty processor, Proceedings of the seventh annual ACM Symposium on Principles of distributed computing, p.263-275, August 15-17, 1988, Toronto, Ontario, Canada [doi>10.1145/62546.62590]
	3	Kenneth P. Birman , Thomas A. Joseph, Reliable communication in the presence of failures, ACM Transactions on Computer Systems (TOCS), v.5 n.1, p.47-76, Feb. 1987 [doi>10.1145/7351.7478]
	4	Gabriel Bracha , Sam Toueg, Asynchronous consensus and broadcast protocols, Journal of the ACM (JACM), v.32 n.4, p.824-840, Oct. 1985 [doi>10.1145/4221.214134]
	5	Jo-Mei Chang , N. F. Maxemchuk, Reliable broadcast protocols, ACM Transactions on Computer Systems (TOCS), v.2 n.3, p.251-273, Aug. 1984 [doi>10.1145/989.357400]
	6	Cristian, F., Aghili, H., and Strong, R. Atomic broadcast: From simple message diffusion to Byzantine agreement. In Proceedings of the iEEE Symposium on Fault Tolerant Computing Systems, 1985, pp. 200-206.
	7	Danny Dolev , Cynthia Dwork , Larry Stockmeyer, On the minimal synchronism needed for distributed consensus, Journal of the ACM (JACM), v.34 n.1, p.77-97, Jan. 1987 [doi>10.1145/7531.7533]
	8	Michael J. Fischer , Nancy A. Lynch , Michael S. Paterson, Impossibility of distributed consensus with one faulty process, Journal of the ACM (JACM), v.32 n.2, p.374-382, April 1985 [doi>10.1145/3149.214121]
	9	Leslie Lamport , Robert Shostak , Marshall Pease, The Byzantine Generals Problem, ACM Transactions on Programming Languages and Systems (TOPLAS), v.4 n.3, p.382-401, July 1982 [doi>10.1145/357172.357176]
	10	Leslie Lamport, Time, clocks, and the ordering of events in a distributed system, Communications of the ACM, v.21 n.7, p.558-565, July 1978 [doi>10.1145/359545.359563]
	11	S. W. Luan , V. D. Gligor, A Fault-Tolerant Protocol for Atomic Broadcast, IEEE Transactions on Parallel and Distributed Systems, v.1 n.3, p.271-285, July 1990 [doi>10.1109/71.80156]
	12	P. M. Melliar-Smith , L. E. Moser , V. Agrawala, Broadcast Protocols for Distributed Systems, IEEE Transactions on Parallel and Distributed Systems, v.1 n.1, p.17-25, January 1990 [doi>10.1109/71.80121]
	13	K J Perry , S Toueg, Distributed agreement in the presence of processor and communication faults, IEEE Transactions on Software Engineering, v.12 n.3, p.477-482, March 1986
	14	Larry L. Peterson , Nick C. Buchholz , Richard D. Schlichting, Preserving and using context information in interprocess communication, ACM Transactions on Computer Systems (TOCS), v.7 n.3, p.217-246, Aug. 1989 [doi>10.1145/65000.65001]
	15	Rabin, M. Randomized Byzantine generals. In Proceedings of the ~4th Symposium of Foundations of Computer Science, 1983, pp. 403-409.
	16	Wensley, J. et al. SIFT: Design and analysis of a faulttolerant computer for aircraft control. Proc. of the IEEE 66, 10 (Oct. 1978), 1240-1255.

CITED BY 2

	Deborah A. Agarwal , Louise E. Moser, A graphical interface for analysis of communication protocols, Proceedings of the 1992 ACM annual conference on Communications, p.149-156, March 03-05, 1992, Kansas City, Missouri, United States
	P. M. Melliar-Smith , Louise E. Moser, Performance analysis of a broadcast communications protocol, ACM SIGMETRICS Performance Evaluation Review, v.19 n.1, p.1-10, May 1991

Collaborative Colleagues:

Louise E. Moser: colleagues

P. M. Melliar-Smith: colleagues

Vivek Agrawala: colleagues

Adobe Acrobat

QuickTime

Windows Media Player

Real Player