Time Warp on a shared-memory multiprocessor. Technical report
Technical Report
·
OSTI ID:6063010
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
Shared virtual memory on loosely coupled multiprocessors
Lexical analysis on a moderately sized multiprocessor. Technical report
Dynamic process simulation of a distillation column on a shared memory parallel processor computer
Thesis/Dissertation
·
Tue Dec 31 23:00:00 EST 1985
·
OSTI ID:6674218
Lexical analysis on a moderately sized multiprocessor. Technical report
Technical Report
·
Sat Oct 01 00:00:00 EDT 1988
·
OSTI ID:5754957
Dynamic process simulation of a distillation column on a shared memory parallel processor computer
Conference
·
Thu Dec 31 23:00:00 EST 1987
·
OSTI ID:5587669