Skip to main content
Log in

Sparse matrix operations on several multi-core architectures

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

This paper compares various contemporary multicore-based microprocessor architectures from different vendors with different memory interconnects regarding performance, speedup, and parallel efficiency. Sparse matrix decomposition is used as a benchmark application. The example matrix used in the experiments comes from an electrical engineering application, where numerical simulation of physical processes plays an important role in the design of industrial products.

Within this context, thread-to-core pinning and cache optimization are two important aspects which are investigated in more detail.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Banerjee PK (1994) The boundary element methods in engineering. McGraw-Hill College, New York

    Google Scholar 

  2. Chan SM, Brandwajn V (1986) Partial matrix refactorization. In: IEEE transactions on power systems, vol PWRS-1, No 1, February 1986

  3. Cuthill E, McKee J (1969) Reducing the bandwidth of sparse symmetric matrices. In: ACM annual conference/annual meeting, Proceedings of the 24th national conference, pp 157–172

  4. DiME DFG Project, Web page http://www10.informatik.uni-erlangen.de/Research/Projects/DiME

  5. Duff IS, Erisman AM, Reid JK (1986) Direct methods for sparse matrices. Oxford University Press, Oxford

    MATH  Google Scholar 

  6. Golub GK, Van Loan CF (1996) Matrix computations, 3rd edn. John Hopkins University Press, New York

    MATH  Google Scholar 

  7. Harrington RF (1992) Field computation by moment methods. IEEE Press, Piscataway

    Google Scholar 

  8. Jin J (1993) The finite element method in electromagnetics. Wiley, Chichester

    MATH  Google Scholar 

  9. Klug T, Ott M, Weidendorfer J, Trinitis C (2008) autopin -â- automated optimization of thread-to-core pinning on multicore system. Trans High-Perform Embed Archit Compil 3(4)

  10. National Institute of Standards and Technology. Matrix Market http://math.nist.gov/MatrixMarket/

  11. Ott M, Klug T, Weidendorfer J, Trinitis C (2008) autopin—automated optimization of thread-to-core pinning on multicore systems. In: First workshop on programmability issues for multi-core computers (MULTIPROG). Workshop proceedings, 1st Multiprog workshop, Gothenburg, Sweden, January 2008

  12. Taflove A, Hagness SC (2005) Computational electrodynamics: the finite-difference time-domain method, 3rd edn. Artech House, Boston

    Google Scholar 

  13. OpenMP.org. The OpenMP API specification for parallel programming http://www.openmp.org/

  14. Tinney WF, Brandwajn V, Chan SM (1985) Sparse vector methods. In: IEEE transactions on power apparatus and systems, vol PAS-104, No 2, February 1985

  15. The Valgrind Developers. Valgrind Web page http://valgrind.org/

  16. Weidendorfer J KCachegrind Web page http://kcachegrind.sourceforge.net/

  17. Weidendorfer J, Kowarschik M, Trinitis C (2004) A tool suite for simulation based analysis of memory access behavior. In: ICCS 2004: 4th international conference on computational science. LNCS, vol 3038. Springer, Berlin, pp 440–447

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Carsten Trinitis.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Trinitis, C., Küstner, T., Weidendorfer, J. et al. Sparse matrix operations on several multi-core architectures. J Supercomput 57, 132–140 (2011). https://doi.org/10.1007/s11227-010-0428-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-010-0428-9

Keywords

Navigation