Download:
|
by Rajive L. Bagrodia, Vikas Jha
ftp://ftp.cs.ucla.edu/tech-report/96-reports/960044.ps.Z
Add To MetaCart
Abstract:
We examine the problem of efficiently executing a simulation model written in an algorithmindependent simulation language, using a variety of parallel conservative algorithms. The conservative algorithms implemented and compared include the null message algorithm, the conditional-event algorithm, and a new algorithm which is a combination of these. We describe how a restricted form of dynamic topology can be supported by conservative algorithms. Language constructs to express lookahead are also discussed. We evaluate the performance of these algorithms using two kinds of benchmarks. A queueing network simulation which is commonly used to evaluate parallel simulation protocols, and a set of synthetic benchmarks that help us study relationships between the performance of conservative protocols and application characteristics such as lookahead, communication topology, message population, and computation granularity.
Citations
|
571
|
Parallel discrete event simulation
– Fujimoto
- 1990
|
|
192
|
Distributed Discrete-Event Simulation
– Misra
- 1985
|
|
191
|
Asynchronous Distributed Simulation via a Sequence of Parallel Computations
– Chandy, Misra
- 1981
|
|
99
|
Maisie: A language for the design of efficient discrete-event simulations
– Bagrodia, Liao
- 1994
|
|
57
|
Global virtual time algorithms
– Bellenot
- 1990
|
|
55
|
The conditional event approach to distributed simulation
– Chandy, Sherman
- 1989
|
|
47
|
Performance measurements of distributed simulation strategies
– Fujimoto
- 1989
|
|
41
|
The Yaddes distributed discrete event simulation specification language and execution environments
– Preiss
- 1989
|
|
23
|
A unifying framework for distributed simulation
– Bagrodia, Chandy, et al.
- 1991
|
|
22
|
State of The Art in Parallel Simulation
– Fujimoto, Nicol
- 1992
|
|
19
|
Variants of the Chandy-Misra-Bryant distributed discrete-event simulation algorithm
– Su, Seitz
- 1989
|
|
17
|
Parallel Discrete Event Simulation of FCFS Stochastic Queueing Networks
– Nicol
- 1988
|
|
16
|
A framework for automatic lookahead computation in conservative simulation
– Cota, Sargent
- 1990
|
|
14
|
Calendar queues: A fast 0(1) priority queue implementation for the simulation event set problem
– Brown
- 1988
|
|
14
|
Understanding the Limits of Optimistic and Conservative Parallel Simulation
– Lin
- 1990
|
|
13
|
The object library for parallel simulation (OLPS
– Abrams
- 1988
|
|
12
|
The C Programmer's Abbreviated Guide to Multicomputer Programming, CaI_.¢cn-CS-TR-88-1
– Seitz, Seizovic, et al.
- 1988
|
|
4
|
Parallel Gate-Level Circuit Simulation on Shared Memory Architectures
– Bagrodia, Chen, et al.
- 1995
|
|
4
|
Language support for parallel discrete-event simulations
– Bagrodia
- 1994
|
|
4
|
Parallel Logic Level Simulation of VLSI Circuits
– Bagrodia, Li, et al.
- 1994
|
|
4
|
Language support for parallel simulation
– Rajaei, Ayani
- 1992
|
|
2
|
A Language Supporting Efficient Distributed Discrete-Event Simulations
– Maisie
- 1993
|
|
2
|
Exploiting dynamic topological information to speed up concurrent multicomputer simulation
– Lin
- 1992
|
|
1
|
Scalable simulation of a high speed wormhole network in a parallel language
– Bagrodia, Gerla, et al.
|
|
1
|
Parallel switch-level vlsi simulation
– Chen, Bagrodia, et al.
- 1995
|
