Skip to main content

Optimization for the High Performance LINPACK Benchmark

  • Chapter
  • First Online:
The Student Supercomputer Challenge Guide

Abstract

HPL (High Performance LINPACK) benchmark can reflect the system’s capacity to do floating-point operations, and is the most popular way to evaluate the performance of the system. The two releases of the Top500 list every year use the HPL test to rank different systems.

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

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to ASC Community .

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Science Press and Springer Nature Singapore Pte Ltd

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

ASC Community (2018). Optimization for the High Performance LINPACK Benchmark. In: The Student Supercomputer Challenge Guide. Springer, Singapore. https://doi.org/10.1007/978-981-10-3731-3_11

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-3731-3_11

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-3730-6

  • Online ISBN: 978-981-10-3731-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics