ACM Home Page
Please provide us with feedback. Feedback
Efficient aggregation of multiple PLs in distributed memory parallel simulations
Full text PdfPdf (422 KB)
Source Winter Simulation Conference archive
Proceedings of the 21st conference on Winter simulation table of contents
Washington, D.C., United States
Pages: 680 - 685  
Year of Publication: 1989
ISBN:0-911801-58-8
Authors
Sponsors
IIE : Institute of Industrial Engineers
NIST : National Institue of Standards & Technology
SES : SES
TIMS/CS :
IEEE-CS : Computer Society
ORSA : Operations Research Society of America
SIGSIM: ACM Special Interest Group on Simulation and Modeling
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 4,   Citation Count: 14
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

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

ABSTRACT

The state of research in parallel simulation now demands that we experiment with a multitude of simulation models. It is evident that large-scale simulations involving many interacting logical processes should be a focal point of such experimentation, as large-scale simulations will benefit the most from parallelism. This realization raises a number of issues. Large-scale parallel simulations must aggregate many logical processes onto each machine in a distributed memory architecture. This fact creates internal management problems--how does one synchronize in such a setting? How does one efficiently find and manage the simulation workload? If we are to experiment with multiple models, what underlying functions can we extract to program once, and use many times? This paper describes YAWNS, Yet Another Windowing Network Simulator, for dealing with these problems.


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
Abrams, M. A common interface for Byrant-Chandy-Misra, Time-Warp, and sequential simulators. In Proceedings of the 1989 Winter Simulation Conference, Washington, D.C., 1989.
 
2
Ayani, R. A parallel simulation scheme based on distances between objects. In Distributed Simulation 1989, SCS Simulation Series, 1989, pp. 113--118.
 
3
Chandy, K. M., and Sherman, R. The conditional event approach to distributed simulation. In Distributed Simulation 1989, SCS Simulation Series, 1989, pp. 113--118.
 
4
Fox, G. Johnson, M., Lyzenga, G. Otto, S., Salmon, J., and Walker, D. Solving Problems on Concurrent Computers. Prentice-Hall, Englewood Cliffs, New Jersey, 1988.
 
5
Lubachevsky, B. Efficient distributed event-driven simulation of multiple-loop networks. CACM 32,1(1989), pp. 111--123.
 
6
Nicol, D. The cost of conservative synchronization in parallel discrete-event simulations. Submitted for publication.
 
7
Reynolds, P. F. Jr. Comparative analyses of parallel simulation protocols. In Proceedings of the 1989 Winter Simulation Conference, Washington, D. C., 1989.
 
8
Wagner, D. Conservative Parallel Simulation: Principles and Practice. Ph.D. thesis, University of Washington, 1989.

CITED BY  14

Collaborative Colleagues:
D. M. Nicol: colleagues
C. C. Michael: colleagues
P. Inouye: colleagues