ACM Home Page
Please provide us with feedback. Feedback
A performance evaluation methodology for parallel simulation protocols
Full text Publisher SitePublisher Site PdfPdf (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
IEEE-CS\TCSIM : TC on Simulation
SIGSIM: ACM Special Interest Group on Simulation and Modeling
SCS : Society for Computer Simulation
Publisher
IEEE Computer Society  Washington, DC, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 14,   Citation Count: 7
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/238788.238842
What is a DOI?

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
 
 
 
 
 

Collaborative Colleagues:
Vikas Jha: colleagues
Rajive Bagrodia: colleagues

Peer to Peer - Readers of this Article have also read: