Time Warp on a shared-memory multiprocessor. Technical report
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, the studies also indicate that state saving overheads represent a significant stumbling block for many parallel simulations using Time Warp.
- Research Organization:
- Utah Univ., Salt Lake City (USA). Dept. of Computer Science
- OSTI ID:
- 6063010
- Report Number(s):
- AD-A-203088/0/XAB; UUCS-88-021A
- Country of Publication:
- United States
- Language:
- English
Similar Records
The effectiveness of caches and data prefetch buffers in large-scale shared memory multiprocessors
Performance of an OR-parallel logic programming system
Related Subjects
ARRAY PROCESSORS
MEMORY MANAGEMENT
COMPUTERIZED SIMULATION
PARALLEL PROCESSING
ALGORITHMS
CANCELLATION
EFFICIENCY
MEMORY DEVICES
PROGRESS REPORT
REPAIR
VARIATIONS
DOCUMENT TYPES
MATHEMATICAL LOGIC
PROGRAMMING
SIMULATION
990210* - Supercomputers- (1987-1989)