Time-based performance evaluation of protocols for distributed systems

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Time-based performance evaluation of protocols for distributed systems: an alternative to message counting

Full text

Pdf (480 KB)

Source

Winter Simulation Conference archive
Proceedings of the 22nd conference on Winter simulation table of contents

New Orleans, Louisiana, United States

Pages: 441 - 445

Year of Publication: 1990

ISBN:0-911801-72-3

Authors

Phil Kearns	Department of Computer Science, The College of William and Mary, Williamsburg, Virginia
Jeffery E. Payne	BDM International, Inc., 1300 N. 17th St. #950, Arlington, Virginia

Sponsors

IEEE-CS : Computer Society
IEEE-SMCS : Systems, Man & Cybernetics Society
ORSA : Operations Research Society of America
SIGSIM: ACM Special Interest Group on Simulation and Modeling
TIMS :
IIE : Institute of Industrial Engineers
SCS : Society for Computer Simulation
ASA : American Statistical Association
NIST : National Institue of Standards & Technology

Publisher

IEEE Press Piscataway, NJ, USA

Bibliometrics

Downloads (6 Weeks): 6, Downloads (12 Months): 14, Citation Count: 0

Additional Information:

references index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTex EndNote ACM Ref

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	Eric C. Cooper, Replicated distributed programs, Proceedings of the tenth ACM symposium on Operating systems principles, p.63-78, December 1985, Orcas Island, Washington, United States
	2	C. J. Fidge, Partial orders for parallel debugging, Proceedings of the 1988 ACM SIGPLAN and SIGOPS workshop on Parallel and distributed debugging, p.183-194, May 05-06, 1988, Madison, Wisconsin, United States
	3	Fidge, C.J. (1988b), "Timestamps in Message-Passing Systems Which Preserve the Partial Ordering," In Proceedings of the Eleventh Australian Computer Science Conference, 56--66.
	4	Kearns, E and B. Koodalattupuram (1989), "Immediate Ordered Service in Distributed Systems," In Proceedings of the Ninth International Conference on Distributed Computing Systems, 611- 618.
	5	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]
	6	Mattern, F. (1988), "Virtual Time and Global States of Distributed Systems," Technical Report, University of Kaiserslautern, Kaiserslautern, FDR.
	7	Payne, J.E. (1989), "Ordering Events in a Distributed System: A Performance Evaluation," M.S. Thesis, Department of Computer Science, The College of William and Mary, Williamsburg, VA.
	8	Payne, J.E. and P. Kearns (1990), "GENSIM: A Simulator for Distributed Protocols," In Proceedings of the 1990 Summer Simulation Conference, to appear.
	9	Glenn Ricart , Ashok K. Agrawala, An optimal algorithm for mutual exclusion in computer networks, Communications of the ACM, v.24 n.1, p.9-17, Jan. 1981 [doi>10.1145/358527.358537]
	10	Fred B. Schneider, Synchronization in Distributed Programs, ACM Transactions on Programming Languages and Systems (TOPLAS), v.4 n.2, p.125-148, April 1982 [doi>10.1145/357162.357163]