ACM Home Page
Please provide us with feedback. Feedback
Estimating the cost of throttled execution in time warp
Full text Publisher SitePublisher Site PdfPdf (443 KB)
Source Workshop on Parallel and Distributed Simulation archive
Proceedings of the tenth workshop on Parallel and distributed simulation table of contents
Philadelphia, Pennsylvania, United States
Pages: 186 - 189  
Year of Publication: 1996
ISBN:0-8186-7539-X
Also published in ...
Author
Samir R. Das  Division of Computer Science, The University of Texas at San Antonio, San Antonio TX
Sponsors
IEEE-CS\TCSIM : TC on Simulation
SIGSIM: ACM Special Interest Group on Simulation and Modeling
SCS : Society for Computer Simulation
Publisher
IEEE Computer Society  Washington, DC, USA
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 1,   Citation Count: 4
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/238788.238844
What is a DOI?

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
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
 
16
 
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