Skip to main content

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

Abstract

This work presents a new approach to the relation between theoretical complexity and performance analysis of MPI programs. The performance analysis is driven by the information produced during the complexity analysis stage and supported at the top level by a complexity analysis oriented language and at the bottom level by a special purpose statistical package.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Valiant, L.G.: A bridging model for parallel computation. Communications of the ACM 33(8), 103–111 (1990)

    Article  Google Scholar 

  2. Culler, D., Karp, R., Patterson, D., Sahay, A., Schauser, K., Santos, E., Subramonian, R., von Eicken, T.: LogP: Towards a realistic model of parallel computation. In: 4th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (May 1993)

    Google Scholar 

  3. Roda, J.L., Sande, F., León, C., González, J.A., Rodríguez, C.: The Collective Computing Model. In: Seventh Euromicro Workshop on Parallel and Distributed Processing, Funchal, Portugal, February 1999, pp. 19–26 (1999)

    Google Scholar 

  4. Goudreau, M., Hill, J., Lang, K., McColl, B., Rao, S., Stephanescu, D., Suel, T., Tsantilas, T.A.: Proposal for the BSP worldwide standard library (1996), http://www.bsp-worldwide.org/standard/stand2.htm

  5. Li, X., Lu, P., Schaefer, J., Shillington, J., Wong, P.S., Shi, H.: On the versatility of parallel sorting by regular sampling. Parallel Computing 19, 1079–1103 (1993)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

García, L., González, J.A., González, J.C., León, C., Rodríguez, C., Rodríguez, G. (2003). Complexity Driven Performance Analysis. In: Dongarra, J., Laforenza, D., Orlando, S. (eds) Recent Advances in Parallel Virtual Machine and Message Passing Interface. EuroPVM/MPI 2003. Lecture Notes in Computer Science, vol 2840. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39924-7_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39924-7_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20149-6

  • Online ISBN: 978-3-540-39924-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics