Numerical algorithms for high-performance computational science

31Citations
Citations of this article
21Readers
Mendeley users who have this article in their library.

Abstract

A number of features of today's high-performance computers make it challenging to exploit these machines fully for computational science. These include increasing core counts but stagnant clock frequencies; the high cost of data movement; use of accelerators (GPUs, FPGAs, coprocessors), making architectures increasingly heterogeneous; and multiple precisions of floating-point arithmetic, including half-precision. Moreover, as well as maximizing speed and accuracy, minimizing energy consumption is an important criterion. New generations of algorithms are needed to tackle these challenges. We discuss some approaches that we can take to develop numerical algorithms for high-performance computational science, with a view to exploiting the next generation of supercomputers. This article is part of a discussion meeting issue 'Numerical algorithms for high-performance computational science'.

Cite

CITATION STYLE

APA

Dongarra, J., Grigori, L., & Higham, N. J. (2020). Numerical algorithms for high-performance computational science. Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, 378(2166). https://doi.org/10.1098/rsta.2019.0066

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free