Analytical Models of Probability Distributions for MPI Point-to-Point Communication Times on Distributed Memory Parallel Computers

  • D. A. Grove
  • P. D. Coddington
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3719)


Measurement and modelling of distributions of data communication times is commonly done for telecommunication networks, but this has not previously been done for message passing communications on parallel computers. We have used the MPIBench program to measure distributions of point-to-point MPI communication times for two different parallel computers, with a low-end Ethernet network and a high-end Quadrics network respectively. Here we present and discuss the results of efforts to fit the measured distributions with standard probability distribution functions such as exponential, lognormal, Erlang, gamma, Pearson 5 and Weibull distributions.


Weibull Distribution Parallel Computer Parallel Program Interarrival Time Communication Time 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Grove, D.A.: Precise MPI performance measurement using MPIBench. In: Proc. of HPC Asia (2001)Google Scholar
  2. 2.
    Grove, D.A.: Performance Modelling of Message-Passing Parallel Programs. PhD thesis, University of Adelaide (2003)Google Scholar
  3. 3.
    Grove, D., Coddington, P.: Modeling message-passing programs with a Performance Evaluating Virtual Parallel Machine. Performance Evaluation 60, 165–187 (2005)CrossRefGoogle Scholar
  4. 4.
    Johnson, N., Kotz, S., Balakrishnan, N.: Continuous Univariate Distributions. Wiley, New York (1995)zbMATHGoogle Scholar
  5. 5.
    Leland, W., Taqqu, M., Willinger, W., Wilson, D.: On the self-similar nature of Ethernet traffic (extended version). IEEE/ACM Transactions on Networking 2, 1–15 (1994)CrossRefGoogle Scholar
  6. 6.
    Park, K., Willinger, W. (eds.): Self-Similar Network Traffic and Performance Evaluation. Wiley, New York (2000)Google Scholar
  7. 7.
    Willinger, W., Taqqu, M.S., Sherman, R., Wilson, D.: Self-similarity through high-variability: Statistical analysis of Ethernet LAN traffic at the source level. IEEE/ACM Transactions on Networking 5, 71–85 (1997)CrossRefGoogle Scholar
  8. 8.
    Feldman, A., Whitt, W.: Fitting mixtures of exponentials to long-tail distributions to analyze network performance models. Performance Evaluation 31, 963–976 (1998)CrossRefGoogle Scholar
  9. 9.
    Zwart, A.P.: Queueing Systems with Heavy Tails. PhD thesis, Eindhoven University of Technology (2001)Google Scholar
  10. 10.
    Law, A.M., Kelton, W.D.: Simulation Modeling & Analysis. McGraw-Hill, New York (1991)Google Scholar
  11. 11.
    Greer Mountain Software (Stat:Fit software, version 1.1), Available from
  12. 12.
    Dodson, B.: Weibull Analysis with Software. ASQ Quality Press, Milwaukee (1995)Google Scholar
  13. 13.
    Anderson, T., Darling, D.: Asymptotic theory of certain goodness-of-fit criteria based on stochastic processes. Annals of Mathematical Statistics 23, 193–212 (1954)CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • D. A. Grove
    • 1
  • P. D. Coddington
    • 1
  1. 1.School of Computer ScienceUniversity of AdelaideAdelaideAustralia

Personalised recommendations