A performance analyser and prediction tool for parallel discrete event simulation

International Journal of Simulation: Systems, Science and Technology

Volumn 4, Issue 1-2, 2003, Pages 7-22

  Juhasz, Zoltan ^a,c   Turner, Stephen ^b   Kuntner, Krisztian ^a   Gerzson, Miklos ^a  

^a UNIVERSITY OF PANNONIA   (Hungary)

^b NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^c UNIVERSITY OF EXETER   (United Kingdom)

Author keywords

Conservative protocol; Critical path; Parallel discrete event simulation; Performance prediction

Indexed keywords

FORECASTING;

CRITICAL PATHS; FUTURE PERFORMANCE; ITS ARCHITECTURE; PARALLEL DISCRETE EVENT SIMULATIONS; PARALLEL IMPLEMENTATIONS; PARALLEL PROGRAM; PERFORMANCE PREDICTION; SEQUENTIAL SIMULATION;

DISCRETE EVENT SIMULATION;

EID: 26844474464     PISSN: 14738031     EISSN: 1473804X     Source Type: Journal    
DOI: None     Document Type: Article

References (34)

1. Bokhari S. H. 1981a, “On the Mapping Problem”, IEEE Trans. Computers, Vol. c-30, No. 3, March 1981.
2. Bokhari S. H. 1981b, “A Shortest Tree Algorithm For Optimal Assignments Across Space and Time in a Distributed Processor System”, IEEE Trans. Software Engrg. SE-7, 6 (Nov. 1981).
3. Chen S. and Eshaghian M. M. 1995, “A Fast Recursive Mapping Algorithm”, Concurrency: Practice and Experience Vol. 7(5), August 1995.
4. Clement M. J. and Quinn M. J.1993, “Analytical Performance Prediction on Multicomputers”. In Proc. Supercomputing’93: Portland, Oregon, November 15–19, 1993, pages 886–894, 1109 Spring Street, Suite 300, Silver Spring, MD 20910, USA, 1993. IEEE Computer Society Press.
5. Coffman, E. G. Jr., Garey M. R. and Johnson D. S. 1978, “An Application of Bin-Packing to Multiprocessor Scheduling”, SIAM J. Comput. 7 (1978), 1-17.
6. Crovella M. E. and LeBlanc T. J. 1993, The Search for Lost Cycles: A New Approach to Parallel Program Performance Evaluation. Technical Report TR479, University of Rochester, Computer Science Department, Dec. 1993.
7. Felderman R. and Kleinrock L. 1992, “Two Processor Conservative Simulation Analysis”. In 6th Workshop on Parallel and Distributed Simulation (PADS92), pages 169–177, 1992.
8. Ferscha A. and Tripathi S. K. 1994, Parallel and Distributed Simulation of Discrete Event Systems. Technical Report CSTR-3336, University of Maryland, College Park, Aug. 1994.
9. Fujimoto R. 1988, “Lookahead in Parallel Discrete Event Simulation”. In Proc. of the International Conference on Parallel Processing III, pages 34–41, 1988.
10. Fujimoto R. M. 1990, “Parallel Discrete Event Simulation”. Communications of the ACM, 33(10):30–53, October 1990.
11. Fujimoto R. M. 2000, Parallel and Distributed Simulation Systems. John Wiley and Sons, 2000.
12. Gelenbe E. 1989, Multiprocessor Performance. Series on Parallel Computing. John Wiley and Sons, New York, 1989.
13. Grama A. Y., Gupta A. and Kumar V. 1993, “Isoefficiency: Measuring the Scalability of Parallel Algorithms and Architectures”. IEEE parallel and distributed technology: systems and applications, 1(3):12–21, Aug. 1993.
14. Gupta A., Akyildiz I. F., and Fujimoto R. 1991, “Performance Analysis of Time Warp with Homogenous Processors and Exponential Task Times”. In ACM SIGMETRICS, Performance Evaluation Review, pages 101–110, 1991.
15. Heiss H. U. and Dormanns M. 1996, “Partitioning and Mapping of Parallel Programs by Self-Organization”, Concurrency: Practice and Experience Vol. 8(9), November 1996.
16. Jefferson D. and Sowizral H. 1985, “Fast Concurrent Simulation Using the Time Warp Mechanism”. In Proc. Of the Conference on Distributed Simulation, pages 63–69, July 1985.
17. Lavenberg S., Muntz R., and Samadi B. 1983, “Performance Analysis of a Rollback Method for Distributed Simulation”. In A. K. Agrawala and S. K. Tripathi, editors, Performance ‘83, pages 117–132. North Holland, New York, 1983.
18. Lim C.-C., Low Y.-H., Gan B.-P., Jain S., Cai W., Hsu W.J. and Huang S.Y. 1999, “Performance Prediction Tools for Parallel Discrete-Event Simulation”. in Proc. PADS’99, pp 148–155.
19. Lin Y. B. and Lazowska E. D. 1989, Exploiting Lookahead in Parallel Simulation. Technical Report 28-10-06, University of Washington, Seattle, 1989.
20. Lubachevsky B. D. 1988, “Bounded Lag Distributed Discrete Event Simulation”. In Proc. of the SCS Multiconference on Distributed Simulation. The Society for Computer Simulation, 1988.
21. Mitra D. and Mitrani I. 1984, “Analysis and Optimum Performance of Two Message-Passing Parallel Processors Synchronized by Rollback”. In Performance’84, pages 35–50. North-Holland, 1984.
22. Nandy B. and Loucks W. M. 1993, “An Algorithm For Partitioning and Mapping Conservative Parallel Simulation onto Multicomputers”, In Proc. 7th Workshop on Parallel and Distributed Simulation, May 1993, pp 43-51.
23. Nicol D. M. 1993, “The Cost of Conservative Synchronization in Parallel Discrete Event Simulations”. Journal of the Association for Computing Machinery, 40, 2:304–333, 1993.
24. Nicol D. M. and Mao W. 1995, “Automated Parallelization of Timed Petri-Net Simulations”, Journal of Parallel and Distributed Computing 29, 1995, pp 60-74.
25. Page E.H. and Nance R.E. 1994, Parallel Discrete Event Simulation: A Modelling Methodological Perspective, Virginia Polytechnic Inst. and State University Technical Report, TR-94-05.
26. Page E.H. 1999, “Beyond Speedup: PADS, the HLA and Web-Based Simulation”, In Proc. PADS’99, pp 2–11.
27. Shen H. 1992, “Self-adjusting Mapping: A Heuristic Mapping Algorithm for Mapping Parallel Programs on to Transputer Networks”, The Computer Journal, Vol. 35., No. 1., 1992.
28. Srinivasan S. and Reynolds P.F. 1993, On Critical Path Analysis of Parallel Discrete Event Simulations, Computer Science Report No. TR-93-29.
29. Stone H. S. 1977, “Multiprocessor Scheduling with the Aid of Network Flow Algorithms”, IEEE Trans. Software Engrg. SE-3, 1 (Jan. 1977).
30. Towsley D. F. 1987, “Allocating Programs Containing Branches and Loops Within a Processor System”, IEEE Trans. Software Engrg. SE-12, (1987).
31. Wagner D. B. and Lazowska E. D. 1989, “Parallel Simulation of Queueing Networks: Limitations and Potentials”. In Proc. of 1989 ACM SIGMETRICS and PERFORMANCE’89, volume 17,1, pages 146–155, May 1989.
32. Wing A. J.1992, “Discrete Event Simulation in Parallel”. In Advances in Parallel Algorithms, Edited by Lydia Kronsjo and Dean Shumsheruddin. Halsted/Wiley, 1992.
33. Wong Y.-C., Hwang S.-Y., and Lin J. Y.-B. 1995, “A Parallelism Analyzer for Conservative Parallel Simulation”. IEEE Transactions on Parallel and Distributed Systems, 6(6):628--638, June 1995.
34. Woodside C. M. and Monforton G. G. 1993, “Fast Allocation of Processes in Distributed and Parallel Systems”, IEEE Trans. Parallel and Distributed Systems, Vol. 4, No. 2, February 1993.