Skip to main content

Performance Evaluation of Strassen Matrix Multiplication Supporting Triple-Double Precision Floating-Point Arithmetic

  • Conference paper
  • First Online:
Computational Science and Its Applications – ICCSA 2020 (ICCSA 2020)

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

Included in the following conference series:

Abstract

The Strassen matrix multiplication can be categorized into divide-and-conquer algorithms, and they are known as the most efficient algorithms. We previously implemented them supporting multiple precision floating-point arithmetic using MPFR and Bailey’s QD libraries and have shown their effectiveness in our papers and open-source codes. In preparation for a future release, we have introduced an optimized triple-word floating-point arithmetic proposed by Fabiano et al., and we found its utility in our implementation of multiple precision matrix multiplication. In this paper, we demonstrate the effectiveness of the Strassen triple-double precision matrix multiplication through performance evaluation compared to those based on QD and MPFR libraries.

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 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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Fabiano, N., Muller, J.-M., Picot, J.: Algorithms for triple-word arithmetic. IEEE Trans. Comput. 68(11), 1573–1583 (2019)

    Article  MathSciNet  Google Scholar 

  2. Joldes, M., Muller, J.-M., Popescu, V., Tucker, W.: CAMPARY: cuda multiple precision arithmetic library and applications. In: Greuel, G.-M., Koch, T., Paule, P., Sommese, A. (eds.) ICMS 2016. LNCS, vol. 9725, pp. 232–240. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-42432-3_29

    Chapter  Google Scholar 

  3. Bailey, D.H.: QD. https://www.davidhbailey.com/dhbsoftware/

  4. MPFR Project, The MPFR library. https://www.mpfr.org/

  5. Granlaud, T.: GMP development team: The GNU Multiple Precision arithmetic library. https://gmplib.org/

  6. Nakata, M.: MPLAPACK(MBLAS). https://github.com/nakatamaho/mplapack

  7. Kouya, T.: Accelerated multiple precision matrix multiplication using Strassen’s algorithm and Winograd’s variant. JSIAM Lett. 6, 81–84 (2014)

    Article  MathSciNet  Google Scholar 

  8. Kouya, T.: Performance evaluation of multiple precision matrix multiplications using parallelized Strassen and Winograd algorithms. JSIAM Lett. 8, 21–24 (2016)

    Article  MathSciNet  Google Scholar 

  9. Kouya, T.: BNCpack. https://na-inet.jp/na/bnc/

  10. Kouya, T.: BNCmatmul. https://na-inet.jp/na/bnc/bncmatmul-0.2.tar.bz2

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Tomonori Kouya .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Kouya, T. (2020). Performance Evaluation of Strassen Matrix Multiplication Supporting Triple-Double Precision Floating-Point Arithmetic. In: Gervasi, O., et al. Computational Science and Its Applications – ICCSA 2020. ICCSA 2020. Lecture Notes in Computer Science(), vol 12253. Springer, Cham. https://doi.org/10.1007/978-3-030-58814-4_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-58814-4_12

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-58813-7

  • Online ISBN: 978-3-030-58814-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics