ACM Home Page
Please provide us with feedback. Feedback
Parallelism analyzers for parallel discrete event simulation
Full text PdfPdf (1.43 MB)
Source ACM Transactions on Modeling and Computer Simulation (TOMACS) archive
Volume 2 ,  Issue 3  (July 1992) table of contents
Pages: 239 - 264  
Year of Publication: 1992
ISSN:1049-3301
Author
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 9,   Downloads (12 Months): 37,   Citation Count: 14
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

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

ABSTRACT

Discrete event simulation is usually time consuming. Recently, there has been a great deal of interest in using parallel computers to speed up the simulation process. Before the parallel simulation approach is applied, it is important to understand the inherent parallelism of simulation applications. A simple technique called critical path analysis was proposed to study paralllelism of simulation applications. This paper describes three critical path analysis algorithms based on different event-scheduling (process scheduling) policies. These algorithms are much simpler than a previous approach, where the events must be recorded in a trace and an extra pass is required to process the event trace. In our approach, the critical path analysis algorithms are integrated with the sequential simulation. At the end of the sequential simulation, the optimal parallel execution time is also computed. Livny proposed an algorithm similar to our approach (His, however, was designed for a specific language). Our algorithms can be integrated with sequential simulation programs written by users or be integrated with simulation languages. Another advantage of our algorithms over previous approaches is that ours can be used to study load balancing under different event-scheduling policies. Since our algorithms can be easily inserted in sequential simulation programs, critical path analysis can be applied to existing sequential programs without difficulty. The results can then be used to predict the performance of parallel simulation on similar applications. An example is given to show how useful information can be obtained from our algorithms.


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
BAILEY, M., AND LIN, Y.-B. Synchronization strategies for logic-level simulation. To appear in Int. J. Comput. Simul., 1992.
 
2
 
3
BERRY, O. Private communication. 1992.
 
4
BERRY, O., AND JEFFERSON, D. Critical path analysis of distributed simulation. In Proceed- ~ngs 1985 SCS Mult~conference on D~str~buted Szmulation (Jan. 1985), pp. 57-60.
 
5
CHANDY, K. M., AND MISRA, J. Distributed simulation: A case study in design and verification of distributed programs. 1EEE Trans. Softw. Eng. SE-5, 5 (Sept. 1979), 440-452.
 
6
FUJIMOTO, R.M. Lookahead in parallel discrete event simulation. In Proceedings International Conference on Parallel Processing, Vol. III, 1988, pp. 34-41.
7
 
8
9
10
 
11
LIN, Y.-B., ANn LAZOWSKA, E.D. Optimality considerations for Time Warp parallel simulation. In Proceedings 1990 SCS Multzconference on D~strzbuted Simulation (Jan. 1990), pp. 29-34.
12
 
13
LIN, Y.-B., AND LAZOWSKA, E.D. Effects of process scheduling in parallel smlulation. Int. J. Comput. Szmul., 2, i (1992).
 
14
LIN, Y.-B., AND MAK, V.K. On simulating a large-scale mobile radio system. Submitted for publication, 1992.
 
15
LIN, Y.-B., LAZOWSKA, E. D., ANn BAER, J.-L. Conservative parallel simulation for systems with no lookahead. In Proceedings 1990 SCS Multzconference on D~strzbuted S~mulat~on (Jan. 1990), pp. 144 149.
 
16
LrvNY, M A study of parallelism in distributed simulation. In Proceedzngs 1985 SCS Multtconference on Distrtbuted Simulation (Jan. 1985), pp. 94-98.
 
17
LUBACHEVSKY, B. Efficient distributed event-driven simulations of multiple-loop networks. Commun. ACM 21, 2 (March 1989).
 
18
NANDY, B., AND LOUCKS, W. M. An algorithm for partitioning and mapping conservative parallel simulation onto multicomputers. In Proceedtngs 6th Workshop on Parallel and Distributed Stmulatzon (Jan. 1992), pp. 139-146
 
19
NICOL, D. M. The cost of conservative synchronization in parallel discrete event simulations. Tech. Rep., Dept. of Computer Science, College of Wilham and Mary, 1989.
 
20
REIHER, P, FUJIMOTO, R., BELLENOT, S., AND JEFFERSON, D. Cancellation strategies in optimistic execution systems. In Proc. 1990 SCS Multiconference on Distributed Simulation (Jan. 1990), pp. 112-121.
 
21
SOKOL, L. M., MUTCHLER, P. A., AND WEISSMAN, J. B. The role of event granularity m parallel simulation design. In Proceedings 6th Workshop on Parallel and Distrzbuted Sirnulatton (Jan. 1992)~ pp. 178-185.
22

CITED BY  14