Skip to main content

Abstract

The environment in which a parallel application is executed has high impact on the performance of the application due to interference caused by various factors in the execution environment. A detailed understanding of the sensitivity of the application to the parameters describing the execution environment can be of great help in (a) predicting a suitable target machine model for the application, (b) predicting its performance on the target machine, and (c) any algorithmic bottlenecks. In this paper, we analyze a suite of parallel applications for their sensitivity to local and non-local interference arising due to various factors in a parallel environment. We create a test bed consisting of five different parallel applications taken from different sources and analyze their sensitivity to single node and multi-node perturbations and show that parallel applications can behave very differently under different conditions of interference in the environment in which they are running. The main contributions of this paper are: (a) studying a suite of parallel algorithms for their sensitivity to local and non-local interference, (b) demonstrate that an application can behave differently to different interference levels in the environment, (c) demonstrate that the sensitivity of an application can be quantified as its absorption ratio at a given interference level.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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.

Similar content being viewed by others

References

  1. D. Bader. A practical parallel algorithm for cycle detection in partitioned digraphs. Technical Report UNM/AHPCC99- 013, 1999.

    Google Scholar 

  2. D. Bader and J. Ja’Ja’. Practical parallel algorithms for dynamic data redistribution, median finding, and selection. 10th International Parallel Processing Symposium (IPPS 96) Conference, Honolulu, HI, April 15-19, pages 292.301, 1996.

    Google Scholar 

  3. R. M. Badia, J. Labarta, J. Gim’enez, and F. Escal’e. DIMEMAS: Predicting MPI applications behavior in Grid environments. Workshop on Grid Applications and Programming Tools, 8 th Global Grid Forum (GGF8), Seattle, WA, 2003.

    Google Scholar 

  4. Message Passing Interface Forum. MPI: A message-passing interface standard. Technical Report UT-CS-94-230, University of Tennessee, 1994.

    Google Scholar 

  5. R. Mraz. Reducing the variance of point to point transfers in the IBM 9076 parallel computer. In Proceedings of the 1994 conference on Supercomputing, 1994.

    Google Scholar 

  6. J. Nieplocha and B. Carpenter. Armci: A portable remote memory copy library for distributed array libraries and compiler run-time systems. Lecture Notes in Computer Science, 1999.

    Google Scholar 

  7. U. of California. http://setiathome.berkeley.edu/.

    Google Scholar 

  8. F. Petrini, D. Kerbyson, and S. Pakin. The Case of the Missing Supercomputer Performance: Achieving Optimal Performance on the 8,192 Processors of ASCI Q. In Proceedings of Supercomputing 2003, 2003.

    Google Scholar 

  9. H. Shi and J. Schaeffer. Parallel sorting by regular sampling. Journal of Parallel and Distributed Computing, 14(4):361. 372, 1992.

    Article  MATH  Google Scholar 

  10. M. Sottile and R. Minnich. Analysis of Microbenchmarks for the Performance Tuning of Clusters. In Proceedings of Cluster 2004, 2004.

    Google Scholar 

  11. M. J. Sottile, V. Chandu, and D. A. Bader. Performance analysis of parallel programs via message-passing graph traversal. 20th IEEE Int’l Parallel and Distributed Processing Symp. (IPDPS), Rhodes Island, Greece, April 25-29, 2006.

    Google Scholar 

  12. V. S. Sunderam. PVM: a framework for parallel distributed computing. Concurrency, Practice and Experience, 2(4):315. 340, 1990.

    Article  Google Scholar 

  13. I. web page. www.intel.com/software/products/cluster/clustertoolkit/index.htm.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer

About this paper

Cite this paper

Chandu, V.P., Singh, K. (2007). Sensitivity analysis of parallel applications to local and non-local interference. In: Sobh, T. (eds) Innovations and Advanced Techniques in Computer and Information Sciences and Engineering. Springer, Dordrecht. https://doi.org/10.1007/978-1-4020-6268-1_83

Download citation

  • DOI: https://doi.org/10.1007/978-1-4020-6268-1_83

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-1-4020-6267-4

  • Online ISBN: 978-1-4020-6268-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics