An evaluation of implementations of the CMB parallel simulation algorithm on distributed memory multicomputers

A model of a message passing network is used to analyze the behavior of three implementations of the Chandy-Misra-Bryant (CMB) parallel simulation algorithm. The characteristics of the model, the organization of the logical processes (LPs) that constitute the simulator and the characteristics of the host parallel computer have a definite influence on the achieved performance, measured in terms of speedup. Large, loaded models help CMB to synchronize with a minimum overhead, efficiently exploiting the available parallelism. Mapping several LPs onto each processor achieves a better use of the available processing power, because while an LP is blocked (synchronizing) others can use the CPU. However, it is not convenient to map too many LPs onto each processor because the synchronization cost would be too high. The communication demands of CMB reduce its efficiency in environments where the cost of passing messages is too high: the performance of CMB running on a network of workstations is quite poor; in contrast, good speedups can be achieved using commercial multicomputers.

[1]  Philip Heidelberger,et al.  Parallel simulation of the IBM SP2 interconnection network , 1995, WSC '95.

[2]  Randal E. Bryant,et al.  SIMULATION OF PACKET COMMUNICATION ARCHITECTURE COMPUTER SYSTEMS , 1977 .

[3]  Pen-Chung Yew,et al.  Parallel discrete event simulation on shared-memory multiprocessors , 1991 .

[4]  P. Yew,et al.  Parallel discrete event simulation on shared-memory multiprocessors , 1991, [1991] Proceedings of the 24th Annual Simulation Symposium.

[5]  William J. Dally,et al.  A VLSI Architecture for Concurrent Data Structures , 1987 .

[6]  Message P Forum,et al.  MPI: A Message-Passing Interface Standard , 1994 .

[7]  Edward D. Lazowska,et al.  Conservative parallel discrete event simulation: principles and practice , 1989 .

[8]  Jayadev Misra,et al.  Distributed discrete-event simulation , 1986, CSUR.

[9]  Agustin Arruabarrena,et al.  A Perfomance Evaluation of Adaptive Routing in Bidimensional Cut-Through Networks , 1993, Parallel Process. Lett..

[10]  Satish K. Tripathi,et al.  Parallel and distributed simulation of discrete event systems , 1994 .

[11]  Agustin Arruabarrena,et al.  Parallel simulation of message routing networks , 1995, Proceedings Euromicro Workshop on Parallel and Distributed Processing.

[12]  Vernon Rego,et al.  A performance comparison of event calendar algorithms: An empirical approach , 1993, Softw. Pract. Exp..

[13]  Message Passing Interface Forum.  MPI: A message - passing interface standard , 1994 .

[14]  Richard M. Fujimoto,et al.  Performance Measurements of Distributed Simulation Strategies. , 1987 .

[15]  Agustin Arruabarrena,et al.  An empirical evaluation of techniques for parallel discrete-event simulation of interconnnection networks , 1996, Proceedings of 4th Euromicro Workshop on Parallel and Distributed Processing.

[16]  José Miguel,et al.  CONSERVATIVE PARALLEL SIMULATION OF A MESSAGE-PASSING NETWORK : A PERFORMANCE STUDY , 1995 .

[17]  K. Mani Chandy,et al.  Distributed Simulation: A Case Study in Design and Verification of Distributed Programs , 1979, IEEE Transactions on Software Engineering.

[18]  Agustín Arruabarrena Frutos.  Análisis y evaluación de sistemas de interconexión para procesadores masivamente paralelos , 1994 .

[19]  Bristol , 1907 .

[20]  R. Sarnath,et al.  Proceedings of the International Conference on Parallel Processing , 1992 .

[21]  W. Liu,et al.  Performance Assessment of Large ATM Switching Networks with Parallel Simulation Tool , 1995, ICPP.