Skip to main content
SpringerLink
Log in

Performance Evaluation of Storage Formats for Sparse Matrices in Fortran

  • Conference paper
High Performance Computing and Communications (HPCC 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4208))

Abstract

Many storage formats have been proposed to represent spa- rse matrices. This paper extends to Fortran 95 the performance evaluation of sparse storage formats in Java presented at ICCS 2005, [7]. These experiments have the same set up (almost 200 sparse matrices and matrix-vector multiplication), but now consider the Fortran 95 Sparse BLAS reference implementation.

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

Access this chapter

Log in via an institution
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. The matrix market, http://math.nist.gov/MatrixMarket/

  2. Duff, I.S., Erisman, A.M., Reid, J.K.: Direct Methods for Sparse Matrices. Oxford University Press, Oxford (1986)

    MATH  Google Scholar 

  3. Duff, I.S., Heroux, M.A., Pozo, R.: An overview of the sparse basic linear algebra subprograms: The new standard from the BLAS technical forum. ACM Transactions on Mathematical Software 28(2), 239–267 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  4. Duff, I.S., Vömel, C.: Algorithm 818: A reference model implementation of the Sparse BLAS in Fortran 95. ACM Transactions on Mathematical Software 28(2), 268–283 (2002)

    Article  MATH  Google Scholar 

  5. Eun-Jin, K., Yelick, A., Vuduc, R.: SPARSITY: An optimization framework for sparse matrix kernels. International Journal of High Performance Computing Applications 18(1), 135–158 (2004)

    Article  Google Scholar 

  6. Gundersen, G., Steihaug, T.: Data structures in Java for matrix computations. Concurrency and Computation: Practice and Experience 16(8), 799–815 (2004)

    Article  Google Scholar 

  7. Luján, M., Usman, A., Hardie, P., Freeman, T.L., Gurd, J.R.: Storage formats for sparse matrices in Java. In: Sunderam, V.S., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds.) ICCS 2005. LNCS, vol. 3514, pp. 364–371. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  8. Pooch, U.W., Nieder, A.: A survey of indexing techniques for sparse matrices. ACM Computing Surveys 5(2), 109–133 (1973)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer & Information Sciences, PIEAS (Pakistan Institute of Engineering & Applied Science), Islamabad, Pakistan

    Anila Usman

  2. Centre for Novel Computing, The University of Manchester, Oxford Road, Manchester, M13 9PL, United Kingdom

    Mikel Luján, Len Freeman & John R. Gurd

Authors
  1. Anila Usman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mikel Luján
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Len Freeman
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. John R. Gurd
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1.  ,  

    Michael Gerndt

  2. GUP, Institute of Graphics and Parallel Processing, Johannes Kepler University, Altenbergerstraße 69, A-4040, Linz, Austria

    Dieter Kranzlmüller

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Usman, A., Luján, M., Freeman, L., Gurd, J.R. (2006). Performance Evaluation of Storage Formats for Sparse Matrices in Fortran. In: Gerndt, M., Kranzlmüller, D. (eds) High Performance Computing and Communications. HPCC 2006. Lecture Notes in Computer Science, vol 4208. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11847366_17

Download citation

  • DOI: https://doi.org/10.1007/11847366_17

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-39372-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation