iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://doi.org/10.1007/978-3-319-08144-1_1
Performance Analytics: Understanding Parallel Applications Using Cluster and Sequence Analysis | SpringerLink
Skip to main content

Performance Analytics: Understanding Parallel Applications Using Cluster and Sequence Analysis

  • Conference paper
  • First Online:
Tools for High Performance Computing 2013

Abstract

Due to the increasing complexity of High Performance Computing (HPC) systems and applications it is necessary to maximize the insight of the performance data extracted from an application execution. This is the mission of the Performance Analytics field. In this chapter, we present three different contributions to this field. First, we demonstrate how it is possible to capture the computation structure of parallel applications at fine grain by using density-based clustering algorithms. Second, we introduce the use of multiple sequence alignment algorithms to asses the quality of a computation structure provided by the cluster analysis. Third, we propose a new clustering algorithm to maximize the quality of the computation structure detected minimizing the user intervention. To demonstrate the usefulness of the different techniques, we also present three use cases.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.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

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 EPUB and 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
Hardcover Book
USD 109.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

Similar content being viewed by others

Notes

  1. 1.

    This scenario also mimics using OpenMP to parallelize the large computation regions.

References

  1. Ahn, D.H., Vetter, J.S.: Scalable analysis techniques for microprocessor performance counter metrics. In: ACM/IEEE Conference on Supercomputing (SC), Baltimore (2002)

    Google Scholar 

  2. Carrington, L., Snavely, A., Gao, X., Wolter, N.: A performance prediction framework for scientific applications. In: 3rd International Conference on Computational Science (ICCS), Saint Petersburg/Melbourne (2003)

    Google Scholar 

  3. Ester, M., Kriegel, H.P., Sander, J., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: 2nd International Conference on Knowledge Discovery and Data Mining (KDD), Portland (1996)

    Google Scholar 

  4. Hartigan, J., Wong, M.: Algorithm AS 136: a K-means clustering algorithm. J. R. Stat. Soc. Ser. C (Appl. Stat.) 28, 100–108 (1979)

    Google Scholar 

  5. Huck, K.A., Malony, A.D.: PerfExplorer: a performance data mining framework for large-scale parallel computing. In: ACM/IEEE Conference on Supercomputing (SC), Seattle (2005)

    Google Scholar 

  6. Joshi, A., Phansalkar, A., Eeckhout, L., John, L.K.: Measuring benchmark similarity using inherent program characteristics. IEEE Trans. Comput. 55(6), 769–782 (2006)

    Article  Google Scholar 

  7. Nickolayev, O.Y., Roth, P.C., Reed, D.A.: Real-time statistical clustering for event trace reduction. Int. J. Supercomput. Appl. High Perform. Comput. 11(2), 144–159 (1997)

    Article  Google Scholar 

  8. Pelleg, D., Moore, A.W.: X-means: extending K-means with efficient estimation of the number of clusters. In: 17th International Conference on Machine Learning (ICML), Stanford (2000)

    Google Scholar 

  9. Sherwood, T., Perelman, E., Hamerly, G., Calder, B.: Automatically characterizing large scale program behavior. In: 10th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), San Jose (2002)

    Google Scholar 

  10. Sprunt, B.: The basics of performance-monitoring hardware. IEEE Micro. 22(4), 64–71 (2002)

    Article  Google Scholar 

  11. Vianney, D., Mericas, A., Maron, B., Chen, T., Kunkel, S., Olszewski, B.: CPI analysis on POWER5, Part 2: introducing the CPI breakdown model. http://www-128.ibm.com/developerworks/library/pa-cpipower2

Download references

Acknowledgements

The work presented in this chapter has been partially founded by IBM, through the IBM-BSC MareIncognito collaboration agreement, the Spanish Ministry of Education under grant BES-2005-7919 and project TIN2007-60625, and the EU/Russia joint project HOPSA.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Juan Gonzalez .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Gonzalez, J., Gimenez, J., Labarta, J. (2014). Performance Analytics: Understanding Parallel Applications Using Cluster and Sequence Analysis. In: Knüpfer, A., Gracia, J., Nagel, W., Resch, M. (eds) Tools for High Performance Computing 2013. Springer, Cham. https://doi.org/10.1007/978-3-319-08144-1_1

Download citation

Publish with us

Policies and ethics