The Community for Technology Leaders
Proceedings Fourteenth Workshop on Parallel and Distributed Simulation (2000)
Bologna, Italy
May 28, 2000 to May 31, 2000
ISSN: 1087-4097
ISBN: 0-7695-0677-1
pp: 53
Christopher D. Carothers , Rensselaer Polytechnic Institute
David Bauer , Rensselaer Polytechnic Institute
Shawn Pearce , Rensselaer Polytechnic Institute
ABSTRACT
In this paper, we introduce a new Time Warp system called ROSS: Rensselaer's Optimistic Simulation System. ROSS is an extremely modular kernel that is capable of achieving event rates as high as 1,250,000 events per second when simulating a wireless telephone network model (PCS) on a quad processor PC server. In a head-to-head comparison, we observe that ROSS out performs the Georgia Tech Time Warp (GTW) system on the same computing platform by up to 180%. ROSS only requires a small constant amount of memory buffers greater than the amount needed by the sequential simulation for a constant number of processors. The driving force behind these high-performance and low memory utilization results is the coupling of an efficient pointer-based implementation framework, Fujimoto's fast GVT algorithm for shared memory multiprocessors, reverse computation and the introduction of Kernel Processes (KPs). KPs lower fossil collection overheads by aggregating processed event lists. This aspect allows fossil collection to be done with greater frequency, thus lowering the overall memory necessary to sustain stable, efficient parallel execution.
INDEX TERMS
CITATION
Christopher D. Carothers, David Bauer, Shawn Pearce, "ROSS: A High-Performance, Low Memory, Modular Time Warp System", Proceedings Fourteenth Workshop on Parallel and Distributed Simulation, vol. 00, no. , pp. 53, 2000, doi:10.1109/PADS.2000.847144
153 ms
(Ver 3.3 (11022016))