|
ABSTRACT
Over-optimistic execution has long been identified as a major performance bottleneck in Time Warp based parallel simulation systems. An appropriate throttle or control of optimism can improve performance by reducing the number of rollbacks. However, the design of an appropriate throttle is a difficult task, as correct computations on the critical path may be blocked, thus increasing the overall execution time. In this paper we build a cost model for throttled execution that involves both rollback probability and probability for an event computation being on the critical path. The model can estimate an appropriate size of time window for a throttled execution using statistics collected from the purely optimistic execution. The model is validated by an experimental study with a set of synthetic workloads.
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
|
D. Ball and S. Hoyt. The adaptive Time-Warp concurrency control algorithm. Proceedings of the S CS Multicon}erence on Distributed Simulation, 22(1):174-177, January 1990.
|
| |
2
|
Samir Das , Richard Fujimoto , Kiran Panesar , Don Allison , Maria Hybinette, GTW: a time warp system for shared memory multiprocessors, Proceedings of the 26th conference on Winter simulation, p.1332-1339, December 11-14, 1994, Orlando, Florida, United States
|
 |
3
|
|
 |
4
|
|
| |
5
|
P. M. Dickens and P. F. Reynolds, Jr. SRADS with local rollback. Proceedings of the S CS Multiconference on Distributed Simulation, 22(1):161-164, January 1990.
|
 |
6
|
|
| |
7
|
|
| |
8
|
R. M. Fujimoto. Performance of Time Warp under synthetic workloads. Proceedings of the S CS Multiconference on Distributed Simulation, 22(1):23-28, January 1990.
|
 |
9
|
|
| |
10
|
D. O. Hamnes and A. Tripathi. Evaluation of a local adaptive protocol for distributed discrete event simulation. In Proceedings of the 199~ International Conference on Parallel Processing, pages III:127-134, August 1994.
|
 |
11
|
|
 |
12
|
|
| |
13
|
|
| |
14
|
L. M. Sokol and B. K. Stucky. MTW: experimental results for a constrained optimistic scheduling paradigm. Proceedings of the SCS Multiconference on Distributed Simulation, 22(1):169-173, January 1990.
|
| |
15
|
Sudhir Srinivasan , Paul F. Reynolds, Jr., Adaptive algorithms vs. Time Warp: an analytical comparison, Proceedings of the 27th conference on Winter simulation, p.666-673, December 03-06, 1995, Arlington, Virginia, United States
[doi> 10.1145/224401.224706]
|
| |
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
|
J. Steinman. SPEEDES: A unified approach to parallel simulation. In 6th Workshop on Parallel and Distributed Simulation, pages 75-84, Jan. 1992.
|
 |
18
|
|
| |
19
|
S. J. Turner and M. Q. Xu. Performance evaluation of the bounded Time Warp algorithm. Proceedings of the SCS Multiconference on Parallel and Distributed Simulation, 24(3):117-126, January 1992.
|
 |
20
|
Z. Xiao F. Gomes , B. Unger , J. Cleary, A fast asynchronous GVT algorithm for shared memory multiprocessor architectures, Proceedings of the ninth workshop on Parallel and distributed simulation, p.203-208, June 13-16, 1995, Lake Placid, New York, United States
|
|