Skip to main content

Fast Measurement of LogP Parameters for Message Passing Platforms

  • Conference paper
  • First Online:
Parallel and Distributed Processing (IPDPS 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1800))

Included in the following conference series:


Performance modeling is important for implementing efficient parallel applications and runtime systems. The LogP model captures the relevant aspects of message passing in distributed-memory architectures. In this paper we describe an efficient method that measures LogP parameters for a given message passing platform. Measurements are performed for messages of different sizes, as covered by the parameterized LogP model, a slight extension of LogP and LogGP. To minimize both intrusiveness and completion time of the measurement, we propose a procedure that sends as few messages as possible. An implementation of this procedure, called the MPI LogP benchmark, is available from our WWW site.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others


  1. A. Alexandrov, M. F. Ionescu, K. E. Schauser, and C. Scheiman. LogGP: Incorporating Long Messages into the LogP Model — One Step Closer Towards a Realistic Model for Parallel Computation. In Proc. Symposium on Parallel Algorithms and Architectures (SPAA), pages 95–105, Santa Barbara, CA, My 1995.

    Google Scholar 

  2. F. Berman, R. Wolski, S. Figueira, J. Schopf, and G. Shao. Application-Level Scheduling on Distributed Heterogeneous Networks. In Proc. Supercomputing’96, Nov. 1996. Online at

  3. R. Bhoedjang, T. Rühl, and H. Bal. User-Level Network Interface Protocols. IEEE Computer, 31(11):53–60, 1998.

    Article  Google Scholar 

  4. D. Culler, R. Karp, D. Patterson, A. Sahay, K. E. Schauser, E. Santos, R. Subramonian, and T. von Eicken. LogP: Towards a Realistic Model of Parallel Computation. In Proc. Symposium on Principles and Practice of Parallel Programming (PPoPP), pages 1–12, San Diego, CA, May 1993.

    Google Scholar 

  5. D. E. Culler, L. T. Liu, R. P. Martin, and C. O. Yoshikawa. Assessing Fast Network Interfaces. IEEE Micro, 16(1):35–43, Feb. 1996.

    Article  Google Scholar 

  6. M. Faerman, A. Su, R. Wolski, and F. Berman. Adaptive Performance Prodiction for Distributed Data-Intensive Applications. In Supercomputing’99, Nov. 1999. Online at

  7. G. Iannello, M. Lauria, and S. Mercolino. Cross—Platform Analysis of Fast Messages for Myrinet. In Proc. Workshop CANPC’98, number 1362 in Lecture Notes in Computer Science, pages 217–231, Las Vegas, Nevada, January 1998. Springer.

    Google Scholar 

  8. T. Kielmann, H. E. Bal, and S. Gorlatch. Bandwidth-efficient Collective Communication for Clustered Wide Area Systems. In Proc. International Parallel and Distributed Processing Symposium (IPDPS 2000), Cancun, Mexico, May 2000.

    Google Scholar 

  9. T. Kielmann, R. F. H. Hofman, H. E. Bal, A. Plaat, and R. A. F. Bhoedjang. MAGPIE: MPI’s Collective Communication Operations for Clustered Wide Area Systems. In Proc. Symposium on Principles and Practice of Parallel Programming (PPoPP), pages 131–140, Atlanta, GA, May 1999.

    Google Scholar 

  10. V. Paxson. On Calibrating Measurements of Packet Transit Times. In Proc. SIGMET-RICS’98/PERFORAMNCE’98, pages 11–21, Madison, Wisconsin, June 1998.

    Google Scholar 

  11. R. Wolski. Forecasting Network Performance to Support Dynamic Scheduling Using the Network Weather Service. In Proc. High-Performance Distributed Computing (HPDC-6), pages 316–325, Portland, OR, Aug. 1997. The network weather service is at

Download references

Author information

Authors and Affiliations


Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kielmann, T., Bal, H.E., Verstoep, K. (2000). Fast Measurement of LogP Parameters for Message Passing Platforms. In: Rolim, J. (eds) Parallel and Distributed Processing. IPDPS 2000. Lecture Notes in Computer Science, vol 1800. Springer, Berlin, Heidelberg.

Download citation

  • DOI:

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67442-9

  • Online ISBN: 978-3-540-45591-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics