ACM Home Page
Please provide us with feedback. Feedback
Adaptive memory management and optimism control in time warp
Full text PdfPdf (322 KB)
Source ACM Transactions on Modeling and Computer Simulation (TOMACS) archive
Volume 7 ,  Issue 2  (April 1997) table of contents
Pages: 239 - 271  
Year of Publication: 1997
ISSN:1049-3301
Authors
Samir R. Das  Univ. of Texas at San Antonio, San Antonio
Richard M. Fujimoto  Georgia Institute of Technology, Atlanta
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 13,   Downloads (12 Months): 43,   Citation Count: 8
Additional Information:

abstract   references   cited by   index terms   review   collaborative colleagues  

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

ABSTRACT

It is widely believed that the Time Warp protocol for parallel discrete event simulation is prone to two potential problems: an excessive amount of wasted, rolled back computation resulting from “rollback thrashing” behaviors, and inefficient use of memory, leading to poor performance of virtual memory and/or multiprocessor cache systems. An adaptive mechanism is proposed based on the Cancelback memory management protocol for shared-memory multiprocessors that dynamically controls the amount of memory used in the simulation in order to maximize performance. The proposed mechanism is adaptive in the sense that it monitors the execution of the Time Warp program, and using simple models, automatically adjusts the amount of memory used to reduce Time Warp overheads (fossil collection, Cancelback, the amount of rolled back computation, etc.) to a manageable level. We describe an implementation of this mechanism on a shared memory, Kendall Square Research KSR-1, multiprocessor and demonstrate its effectiveness in automatically maximizing performance while minimizing memory utilzation, for several synthetic and benchmark discrete event simulation applications. We also demonstrate the adaptive ability of the mechanism by showing that it “tracks” the time-varying nature of a communication network simulation.


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
 
2
ARVIND, K. AND SMART, C. 1992. Hierarchical parallel discrete event simulation in composite ELSA. In Proceedings of 6th Workshop on Parallel and Distributed Simulation (Los Alamitos, CA, Jan.), IEEE Computer Science Press, Los Alamitos, CA, 147-158.
 
3
BALL, D. AND HOYT, S. 1990. The adaptive Time-Warp concurrency control algorithm. Proceedings of the SCS Multiconference on Distributed Simulation 22, 1 (Jan.), SCS, San Diego, CA, 174-177.
 
4
BRINER, J., JR. 1991. Fast parallel simulation of digital systems. Proceedings of the Multiconference on Advances in Parallel and Distributed Simulation 23, 1 (Jan.), SCS, San Diego, CA, 71-77.
5
 
6
7
 
8
9
 
10
 
11
DICKENS, P. M., AND REYNOLDS, P. F. JR. 1990. SRADS with local rollback. Proceedings of the SCS Multiconference on Distributed Simulation 22, 1 (Jan.), SCS San Diego, CA, 161-164.
12
13
 
14
15
 
16
FUJIMOTO, R.M. 1990b. Performance of Time Warp under synthetic workloads. In Proceedings of the SCS Multiconference on Distributed Simulation 22, 1 (Jan.), SCS, San Diego, CA, 23-28.
 
17
HAMNES, D. O., AND TRIPATHI, A. 1994a. Evaluation of a local adaptive protocol for distributed discrete event simulation. In Proceedings of the 1994 International Conference on Parallel Processing (Aug.), CRC Press, Boca Raton, FL, 127-134.
18
19
20
 
21
22
23
24
25
 
26
 
27
MEHL, H. 1991. Speedup of conservative distributed discrete-event simulation methods by speculative computing. Proceedings of the Multiconference on Advances in Parallel and Distributed Simulation 23, 1 (Jan.), SCS, San Diego, CA, 163-166.
 
28
NICOL, D. M., AND FUJIMOTO, R.M. 1994. Parallel simulation today. Ann. Oper. Res. 53, 249-286.
29
30
 
31
PRESLEY, M., EBLING, M., WIELAND, F., AND JEFFERSON, D.R. 1989. Benchmarking the Time Warp Operating System with a computer network simulation. Proceedings of the SCS Multiconference on Distributed Simulation 21, 2 (Mar.), SCS, San Diego, CA, 8-13.
32
33
34
 
35
SOKOL, L. M., AND STUCKY, B. K. 1990. MTW: Experimental results for a constrained optimistic scheduling paradigm. In Proceedings of the SCS Multiconference on Distributed Simulation 22, 1 (Jan.), SCS, San Diego, CA, 169-173.
 
36
 
37
STEINMAN, J. S. 1992. SPEEDES: A multiple-synchronization environment for parallel discrete event simulation. Int. J. Comput. Simul. 2, 3, 251-286.
38
 
39
TURNER, S. J., AND XU, M. Q. 1992. Performance evaluation of the bounded Time Warp algorithm. Proceedings of the SCS Multiconference on Parallel and Distributed Simulation 24, 3 (Jan.), SCS, San Diego, CA, 117-126.
 
40
WIELAND, F., HAWLEY, L., FEINBERG, A., DILORENTO, M., BLUME, L., REIHER, P., BECKMAN, B., HONTALAS, P., BELLENOT, S., AND JEFFERSON, D.R. 1989. Distributed combat simulation and Time Warp: The model and its performance. Proceedings of the SCS Multiconference on Distributed Simulation 21, 2 (Mar.), SCS, San Diego, CA, 14-20.

CITED BY  8


REVIEW

"Anthony Joseph Duben : Reviewer"

Time Warp is an optimistic synchronization protocol in parallel simulation computations. At runtime, it detects out-of-sequence events and recovers by rolling back the calculation to properly account for the events. Time Warp has two major pro  more...

Collaborative Colleagues:
Samir R. Das: colleagues
Richard M. Fujimoto: colleagues