The Community for Technology Leaders
Proceedings 9th Workshop on Parallel and Distributed Simulation (ACM/IEEE) (1995)
Lake Placid, New York
June 14, 1995 to June 16, 1995
ISBN: 0-8186-7120-3
pp: 203
Z. Xiao , Calgary Univ., Alta., Canada
F. Gomes , Calgary Univ., Alta., Canada
B. Unger , Calgary Univ., Alta., Canada
J. Cleary , Calgary Univ., Alta., Canada
The computation of Global Virtual Time is of fundamental importance in Time Warp based Parallel Discrete Event Simulation Systems. Shared memory multiprocessor architectures can support interprocess communication with much smaller overheads than distributed memory systems. This paper presents a new, completely asynchronous, Gvt algorithm which provides very fast and accurate Gvt estimation with significantly lower overhead than previous approaches. The algorithm presented is able to support more efficient memory management, termination, and other global control mechanisms. The Gvt algorithm described enables any Time Warp entity to compute Gvt at any time without slowing down other entities, in particular those executing on the critical path. Experimental results are presented for a shared memory Time Warp system that employs a two tiered distributed memory management scheme. The proof of the correctness and the accuracy of the algorithm are also presented. Finally, some suggestions on possible further optimization of the implementation are given.
discrete event simulation; distributed memory systems; storage management; shared memory systems; time warp simulation; shared memory multiprocessor; GVT algorithm; Global Virtual Time; Time Warp; Discrete Event Simulation; distributed memory management; memory management

Z. Xiao, J. Cleary, B. Unger and F. Gomes, "A fast asynchronous GVT algorithm for shared memory multiprocessor architectures," Proceedings 9th Workshop on Parallel and Distributed Simulation (ACM/IEEE)(PADS), Lake Placid, New York, 1995, pp. 203.
93 ms
(Ver 3.3 (11022016))