The Community for Technology Leaders
Green Image
<p>The behavior of n interacting processors synchronized by the Time Warp protocol is analyzed using a discrete-state, continuous-time Markov chain model. The performance and dynamics of the processes (or processors) are analyzed under the following assumptions: exponential task times and timestamp increments on messages, each event message generates one new message that is sent to a randomly selected process, negligible rollback, state saving, and communication delay, unbounded message buffers, and homogeneous processors. Several performance measures are determined, such as: the fraction of processed events that commit, speedup, rollback probability, expected length of rollback, the probability mass function for the number of uncommitted processed events, the probability distribution function for the virtual time of a process, and the fraction of time the processors remain idle. The analysis is approximate, thus the results have been validated through performance measurements of a Time Warp testbed executing on a shared-memory multiprocessor.</p>
parallel simulation; interacting processors; Time Warp protocol; discrete-state; continuous-time Markov chain model; exponential task times; timestamp increments; event message; negligible rollback; state saving; communication delay; unbounded message buffers; homogeneous processors; performance measures; processed events; speedup; rollback probability; probability mass function; uncommitted processed events; probability distribution function; virtual time; Time Warp testbed; shared-memory multiprocessor; discrete event simulation; Markov processes; multiprocessing systems; performance evaluation; protocols

R. Fujimoto, A. Gupta and I. Akyildiz, "Performance Analysis of Time Warp with Multiple Homogeneous Processors," in IEEE Transactions on Software Engineering, vol. 17, no. , pp. 1013-1027, 1991.
86 ms
(Ver 3.3 (11022016))