Reducing null message traffic in large parallel and distributed systems

Syed S. Rizvi, Khaled M. Elleithy, Aasia Riasat

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations


Null message algorithm (NMA) is one of the efficient conservative time management algorithms that use null messages to provide synchronization between the logical processes (LPs) in a parallel discrete event simulation (PDES) system. However, the performance of a PDES system could be severely degraded if a large number of null messages need to be generated by LPs to avoid deadlock. In this paper, we present a mathematical model based on the quantitative criteria specified in [12] to optimize the performance of NMA by reducing the null message traffic. Moreover, the proposed mathematical model can be used to approximate the optimal values of some critical parameters such as frequency of transmission, Lookahead (L) values, and the variance of null message elimination. In addition, the performance analysis of the proposed mathematical model incorporates both uniform and non-uniform distribution of L values across multiple output lines of an LP. Our simulation and numerical analysis suggest that an optimal NMA offers better scalability in PDES system if it is used with the proper selection of critical parameters.

Original languageEnglish (US)
Title of host publicationIEEE Symposium on Computers and Communications 2008, ISCC 2008
Number of pages7
StatePublished - 2008
Event13th IEEE Symposium on Computers and Communications, ISCC 2008 - Marrakech, Morocco
Duration: Jul 6 2008Jul 9 2008

Publication series

NameProceedings - IEEE Symposium on Computers and Communications
ISSN (Print)1530-1346


Other13th IEEE Symposium on Computers and Communications, ISCC 2008

All Science Journal Classification (ASJC) codes

  • Software
  • Signal Processing
  • General Mathematics
  • Computer Science Applications
  • Computer Networks and Communications


Dive into the research topics of 'Reducing null message traffic in large parallel and distributed systems'. Together they form a unique fingerprint.

Cite this