Time warp on a shared memory multiprocessor

Update Item Information
Publication Type Journal Article
Creator Fujimoto, Richard M.
Title Time warp on a shared memory multiprocessor
Date 1988
Description A variation of the Time Warp parallel discrete event simulation mechanism is presented that is optimized for execution on a shared memory multiprocessor. In particular, the direct cancellation mechanism is proposed that eliminates the need for anti-messages and provides an efficient mechanism for cancelling erroneous computations. The mechanism thereby eliminates many of the overheads associated with conventional, message-based implementations of Time Warp. More importantly, this mechanism effects rapid repairs of the parallel computation when an error is discovered. Initial performance measurements of an implementation of the mechanism executing on a BBN Butterfly? multiprocessor are presented. These measurements indicate that the mechanism achieves good performance, particularly for many workloads where conservative clock synchronization algorithms perform poorly. Speedups as high as 56.8 using 64 processors were obtained. However, our studies also indicate that state saving overheads represent a significant stumbling block for many parallel simulations using Time Warp.
Type Text
Publisher University of Utah
First Page 88
Last Page 21
Language eng
Bibliographic Citation Fujimoto, R. M. (1988). Time warp on a shared memory multiprocessor. UUCS-88-021.
Relation is Part of ARPANET
Rights Management ©University of Utah
Format Medium application/pdf
Format Extent 8,103,818 bytes
Identifier ir-main,16155
ARK ark:/87278/s6hq4hfz
Setname ir_uspace
ID 706331
Reference URL https://collections.lib.utah.edu/ark:/87278/s6hq4hfz
Back to Search Results