## Abstract

Null message algorithm is an important conservative time management protocol in parallel discrete event simulation systems for providing synchronization between the distributed computers with the capability of both avoiding and resolving the deadlock. However, the excessive generation of null messages prevents the widespread use of this algorithm. The excessive generation of null messages results due to an improper use of some of the critical parameters such as frequency of transmission and Lookahead values. However, if we could minimize the generation of null messages, most of the parallel discrete event simulation systems would be likely to take advantage of this algorithm in order to gain increased system throughput and minimum transmission delays. In this paper, a new mathematical model for optimizing the performance of parallel and distributed simulation systems is proposed. The proposed mathematical model utilizes various optimization techniques such as variance of null message elimination to improve the performance of parallel and distributed simulation systems. For the sake of simulation results, we consider both uniform and non-uniform distribution of Lookahead values across multiple output lines of an LP. Our experimental verifications demonstrate that an optimal NMA offers better scalability in parallel discrete event simulation systems if it is used with the proper selection of critical parameters.

Original language | English (US) |
---|---|

Title of host publication | Proceedings of the 2008 Spring Simulation Multiconference, SpringSim'08 |

DOIs | |

State | Published - 2008 |

Event | 2008 Spring Simulation Multiconference, SpringSim'08 - Ottawa, ON, Canada Duration: Apr 14 2008 → Apr 17 2008 |

### Other

Other | 2008 Spring Simulation Multiconference, SpringSim'08 |
---|---|

Country | Canada |

City | Ottawa, ON |

Period | 4/14/08 → 4/17/08 |

## All Science Journal Classification (ASJC) codes

- Computational Theory and Mathematics
- Computer Networks and Communications
- Software