Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Time warp simulation using time scale decomposition

Time warp simulation using time scale decomposition In this paper we consider time scale decomposition as well as spatial decomposition to induce massive parallelism and reduce overhead in distributed discrete-event simulations. We confine our study to the Time Warp strategy and to systems where the durations of activities differ by several orders of magnitude (i.e., systems with fast and slow activities). We show that, for such systems, a large overhead due to rollbacks is encountered when spatial decomposition is used. Moreover, performance degrades as the difference increases between the rates of fast and slow events. Several initial experiments using queueing-network models were designed to evaluate the effectiveness of time scale decomposition in increasing the parallelism and reducing the overhead. These experiments were conducted on a distributed simulation testbed that was implemented on an 18-processor Multimax 320. The application of the above simulation techniques to stochastic Petri net models is illustrated using an example of performability analysis of a fault-tolerant distributed system. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Transactions on Modeling and Computer Simulation (TOMACS) Association for Computing Machinery

Time warp simulation using time scale decomposition

Loading next page...
 
/lp/association-for-computing-machinery/time-warp-simulation-using-time-scale-decomposition-VRidLjOP07

References (22)

Publisher
Association for Computing Machinery
Copyright
The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc.
Subject
Discrete event
ISSN
1049-3301
DOI
10.1145/137926.137959
Publisher site
See Article on Publisher Site

Abstract

In this paper we consider time scale decomposition as well as spatial decomposition to induce massive parallelism and reduce overhead in distributed discrete-event simulations. We confine our study to the Time Warp strategy and to systems where the durations of activities differ by several orders of magnitude (i.e., systems with fast and slow activities). We show that, for such systems, a large overhead due to rollbacks is encountered when spatial decomposition is used. Moreover, performance degrades as the difference increases between the rates of fast and slow events. Several initial experiments using queueing-network models were designed to evaluate the effectiveness of time scale decomposition in increasing the parallelism and reducing the overhead. These experiments were conducted on a distributed simulation testbed that was implemented on an 18-processor Multimax 320. The application of the above simulation techniques to stochastic Petri net models is illustrated using an example of performability analysis of a fault-tolerant distributed system.

Journal

ACM Transactions on Modeling and Computer Simulation (TOMACS)Association for Computing Machinery

Published: Apr 1, 1992

There are no references for this article.