| Adaptive algorithms vs. Time Warp: an analytical comparison |
| Full text |
Pdf
(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 |
|
| Publisher |
IEEE Computer Society
Washington, DC, USA
|
| Bibliometrics |
Downloads (6 Weeks): 2, Downloads (12 Months): 11, Citation Count: 5
|
|
|
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
|
B. Lubachevsky , A. Shwartz , A. Weiss, Rollback sometimes works...if filtered, Proceedings of the 21st conference on Winter simulation, p.630-639, December 04-06, 1989, Washington, D.C., United States
[doi> 10.1145/76738.76819]
|
 |
9
|
|
| |
10
|
Madisetti, V.K., 1993. Randomized algorithms for selfsynchronization. Private communication.
|
| |
11
|
|
 |
12
|
Carmen M. Pancerella , Paul F. Reynolds, Jr., Disseminating critical target-specific synchronization information in parallel discrete event simulations, Proceedings of the seventh workshop on Parallel and distributed simulation, p.52-59, May 16-19, 1993, San Diego, California, United States
|
 |
13
|
P. L. Reiher , F. Wieland , D. Jefferson, Limitation of optimism in the time warp operating system, Proceedings of the 21st conference on Winter simulation, p.765-770, December 04-06, 1989, Washington, D.C., United States
[doi> 10.1145/76738.76834]
|
 |
14
|
|
 |
15
|
Sudhir Srinivasan , Paul F. Reynolds, Jr., Non-interfering GVT computation via asynchronous global reductions, Proceedings of the 25th conference on Winter simulation, p.740-749, December 12-15, 1993, Los Angeles, California, United States
[doi> 10.1145/256563.256834]
|
| |
16
|
Sudhir Srinivasan , Paul F. Reynolds, Jr., NPSI adaptive synchronization algorithms for PDES, Proceedings of the 27th conference on Winter simulation, p.658-665, December 03-06, 1995, Arlington, Virginia, United States
[doi> 10.1145/224401.224705]
|
| |
17
|
|
 |
18
|
|
|