ACM Home Page
Please provide us with feedback. Feedback
Adaptive algorithms vs. Time Warp: an analytical comparison
Full text PdfPdf (789 KB)
Source Winter Simulation Conference archive
Proceedings of the 27th conference on Winter simulation table of contents
Arlington, Virginia, United States
Pages: 666 - 673  
Year of Publication: 1995
ISBN:0-7803-3018-8
Authors
Sudhir Srinivasan  Department of Computer Science, University of Virginia, Charlottesville, VA
Paul F. Reynolds, Jr.  Department of Computer Science, University of Virginia, Charlottesville, VA
Sponsors
IIE : Institute of Industrial Engineers
SCS : Society for Computer Simulation
ASA : American Statistical Association
NIST : National Institue of Standards & Technology
IEEE-CS : Computer Society
IEEE-SMCS : Systems, Man & Cybernetics Society
ACM: Association for Computing Machinery
INFORMS/CS : Computer Science TC
SIGSIM: ACM Special Interest Group on Simulation and Modeling
Publisher
IEEE Computer Society  Washington, DC, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 11,   Citation Count: 5
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/224401.224706
What is a DOI?

ABSTRACT

Adaptive synchronization algorithms have been proposed to improve upon conservative and optimistic algorithms. We present the first known analytical comparison of adaptive, optimistic algorithms and Time Warp. We define a class of adaptive protocols, the asynchronous adaptive waiting protocols (AAWPs) and identify several practical protocols that belong to this class. We show that Time Warp can outperform an AAWP arbitrarily. We describe the Elastic Time Algorithm (ETA), a particular AAWP and show that ETA can outperform Time Warp arbitrarily.


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
Ball, D. and S. Hoyt. 1990. The adaptive Time Warp concurrency control algorithm. Proceedings of the SCS Multiconference on Distributed Simulation, 174- 177.
 
2
Chandy, M. and J. Misra. 1979. Distributed Simulation: A case study in the design and verification of distributed programs. IEEE Transactions on Software Engineering, Vol. SE-5, No. 5, 440-452.
 
3
4
 
5
Hamnes, D.O. and A. Tripathi. 1994. Evaluation of a local adaptive protocol for distributed discrete event simulation. Proceedings of the 1994 International Conference on Parallel Processing, Vol. III, 127-134.
6
 
7
Lipton, R.J. and D.W. Mizelt 1990. Time Warp vs. Chandy-Misra: A worst-case comparison. Proceedings of the 1990 SCS Multiconference on Distributed Simulation, 137-143.
8
9
 
10
Madisetti, V.K., 1993. Randomized algorithms for selfsynchronization. Private communication.
 
11
12
13
14
15
 
16
 
17
18


Collaborative Colleagues:
Sudhir Srinivasan: colleagues
Paul F. Reynolds, Jr.: colleagues