| A performance evaluation methodology for parallel simulation protocols |
| Full text |
Publisher Site
,
Pdf
(582 KB)
|
| Source
|
Workshop on Parallel and Distributed Simulation
archive
Proceedings of the tenth workshop on Parallel and distributed simulation
table of contents
Philadelphia, Pennsylvania, United States
Pages: 180 - 185
Year of Publication: 1996
ISBN:0-8186-7539-X
Also published in ...
|
|
Authors
|
|
Vikas Jha
|
Computer Science Department, UCLA, Los Angeles, CA
|
|
Rajive Bagrodia
|
Computer Science Department, UCLA, Los Angeles, CA
|
|
| Sponsors |
|
| Publisher |
IEEE Computer Society
Washington, DC, USA
|
| Bibliometrics |
Downloads (6 Weeks): 1, Downloads (12 Months): 14, Citation Count: 7
|
|
|
ABSTRACT
Most experimental studies of the performance of parallel simulation protocols use speedup or number of events processed per unit time as the performance metric. Although helpful in evaluating the usefulness of parallel simulation for a given simulation model, these metrics tell us little about the efficiency of the simulation protocol used. In this paper, we describe an Ideal Simulation Protocol (ISP), based on the concept of critical path, which experimentally computes the best possible execution time for a simulation model on a given parallel architecture. Since ISP computes the bound by actually executing the model on the given parallel architecture, it is much more realistic than that computed by a uniprocessor critical path analysis. The paper illustrates, using parameterized synthetic benchmarks, how an ISP-based performance evaluation can lead to much better insights into the performance of parallel simulation protocols than what would be gained from speedup graphs alone.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
|
| |
2
|
|
| |
3
|
O. Berry and D. Jefferson. Critical path analysis of distributed simulation. In Proceedings of 1985 SCS Multzconference on Distmbuted Simulatzon, pages 57-60, January 1985.
|
 |
4
|
|
| |
5
|
K.M. Chandy and R. Sherman. The conditional event approach to distributed simulation. In Distributed Simulation Conference, Miami, 1989.
|
| |
6
|
D. Conklin, J. Cleary, and B. Unger. The sharks world: A study in distributed simulation. In 1990 Simulation Multiconference: Distributed Simulation, San Diego, California, January 1990.
|
 |
7
|
|
| |
8
|
R. M. Fujimoto. Performance measurements of distributed simulation strategies. Technical Report Tech. Rep. UUCS-87-026a, University of Utah, Salt Lake City, 1987.
|
 |
9
|
|
 |
10
|
|
| |
11
|
|
| |
12
|
D.B. Wagner and E.D. Lazoska. Parallel simulation of queueing networks: Limitations and potentials. Technical report 88-09-05, Dept. of Computer Science, University of Washington, Seattle 98195, September 1988.
|
CITED BY 7
|
|
Lokesh Bajaj , Rajive Bargrodia , Richard Meyer, Case study: parallelizing a sequential simulation model, Proceedings of the thirteenth workshop on Parallel and distributed simulation, p.29-36, May 01-04, 1999, Atlanta, Georgia, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Peer to Peer - Readers of this Article have also read:
-
Data structures for quadtree approximation and compression
Communications of the ACM
28, 9
Hanan Samet
-
A hierarchical single-key-lock access control using the Chinese remainder theorem
Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
Kim S. Lee
, Huizhu Lu
, D. D. Fisher
-
The GemStone object database management system
Communications of the ACM
34, 10
Paul Butterworth
, Allen Otis
, Jacob Stein
-
An intelligent component database for behavioral synthesis
Proceedings of the 27th ACM/IEEE Design Automation Conference on
Gwo-Dong Chen
, Daniel D. Gajski
-
Putting innovation to work: adoption strategies for multimedia communication systems
Communications of the ACM
34, 12
Ellen Francik
, Susan Ehrlich Rudman
, Donna Cooper
, Stephen Levine
|