Open AccessComputer ScienceMathematics

S. Blackford, J. Demmel, J. Dongarra, Iain S. Duff, S. Hammarling, G. Henry, M. Heroux, L. Kaufman, A. Lumsdaine, A. Petitet, R. Pozo, K. Remington, Clint Whaley

2002.6.1ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE

DOI: 10.1145/567806.567807

tlooto Summary

This research presents a meta-modelling architecture that automates the very labor-intensive and therefore time-heavy and therefore expensive and expensive and therefore time-heavy and therefore time-heavy and expensive to develop and implement.

Abstract

L. SUSAN BLACKFORD Myricom, Inc. JAMES DEMMEL University of California, Berkeley JACK DONGARRA The University of Tennessee IAIN DUFF Rutherford Appleton Laboratory and CERFACS SVEN HAMMARLING Numerical Algorithms Group, Ltd. GREG HENRY Intel Corporation MICHAEL HEROUX Sandia National Laboratories LINDA KAUFMAN William Patterson University ANDREW LUMSDAINE Indiana University ANTOINE PETITET Sun Microsystems ROLDAN POZO National Institute of Standards and Technology KARIN REMINGTON The Center for Advancement of Genomics and R. CLINT WHALEY Florida State University

Citation format

BLACKFORD, S., et al. An updated set of basic linear algebra subprograms (BLAS). ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 2002, 28.