skip to main content
article
Free Access

An extended set of FORTRAN basic linear algebra subprograms

Published:01 March 1988Publication History
Skip Abstract Section

Abstract

This paper describes an extension to the set of Basic Linear Algebra Subprograms. The extensions are targeted at matrix-vector operations that should provide for efficient and portable implementations of algorithms for high-performance computers.

References

  1. 1 DODSON, D. S., AND LEWIS, J. G. Issues relating to extension of the basic linear algebra subprograms. SIGNUM Newsl. (ACM) 20, 1 (1985), 19-22. Google ScholarGoogle Scholar
  2. 2 DONGARRA, J. J. Increasing the performance of mathematical software through high-level modularity. In Proceedings of the 6th International Symposium on Computing Methods in Engineering and Applied Sciences (Versailles, France), North-Holland, Amsterdam, 1984, pp. 239-248. Google ScholarGoogle Scholar
  3. 3 DONGARRA, J. J., AND EISENSTAT, S. C. Squeezing the most out of an algorithm in CRAY FORTRAN. ACM Trans. Math. Softw. 10, 3 (Sept. 1984), 219-230. Google ScholarGoogle Scholar
  4. 4 DONGARRA, J. J., KAUFMAN, L., AND HAMMARLING, S. Squeezing the most out of eigenvalue solvers on high-performance computers. Linear Algebra Appl. 77 (1986), 113-136.Google ScholarGoogle Scholar
  5. 5 DONGARRA, J. J., BUNCH, J. R., MOLER, C. B., AND STEWART, G.W. LINPACK Users'Guide. SIAM, Philadelphia, Pa., 1979.Google ScholarGoogle Scholar
  6. 6 DONGARRA, J. J., DU CROZ, J. J., HAMMARLING, S., AND HANSON, R.J. A proposal for an extended set of Fortran basic linear algebra subprograms. ACM SIGNUM Newsl. 20, 1 (1985). Google ScholarGoogle Scholar
  7. 7 DONGARRA, J. J., Du CROZ, J. J., HAMMARLING, S., AND HANSON, R.J. Algorithm 656: An extended set of basic linear algebra subprograms: Model implementation and test programs. This issue pp. 18-32. Google ScholarGoogle Scholar
  8. 8 GARBOW, B. S., BOYLE, J. M., DONGARRA, J. J., AND MOLER, C. B. Matrix Eigensystem Routines--EISPACK Guide Extension. Lecture Notes in Computer Science, vol. 51. Springer- Verlag, New York, 1977.Google ScholarGoogle Scholar
  9. 9 HANSON, R., KROGH, F., AND LAWSON, C. A proposal for standard linear algebra subprograms. ACM SIGNUM Newsl. 8 (1973), 16. Google ScholarGoogle Scholar
  10. 10 IEEE. IEEE standard for binary floating-point arithmetic. ANSI/IEEE Stand. 754-1985, IEEE, New York, 1985.Google ScholarGoogle Scholar
  11. 11 LAWSON, C. L., HANSON, R. J., KINCAID, D. R., AND KROGH, F.T. Algorithm 539: Basic linear algebra subprograms for FORTRAN usage {F1}. ACM Trans. Math. Softw. 5, 3 (Sept. 1979), 324-325. Google ScholarGoogle Scholar
  12. 12 LAWSON, C. L., HANSON, R. J., KINCAID, D. R., AND KROGH, F. T. Basic linear algebra subprograms for Fortran usage. ACM Trans. Math. Softw. 5, 3 (Sept. 1979), 308-323. Google ScholarGoogle Scholar
  13. 13 SMITH, B. T., BOYLE, J. M., DONGARRA, J. J., GARBOW, B. S., IKEBE, Y., KLEMA, V. C., AND MOLER, C. B. Matrix Eigensystem RoutinesmEISPACK Guide. Lecture Notes in Computer Science, vol. 6. 2nd ed., Springer-Verlag, New York, 1976.Google ScholarGoogle Scholar

Index Terms

  1. An extended set of FORTRAN basic linear algebra subprograms

        Recommendations

        Reviews

        Charles Raymond Crawford

        This paper describes additions to the set of FORTRAN Basic Linear Algebra Subprograms, or BLAS. The original set of BLAS [1] has been widely accepted and many published programs refer to it. Special machine-code implementations of the BLAS that take advantage of specific machine features have been shown to speed up programs that use them, with no changes to the FORTRAN source. To quote the present paper: “[The BLAS] are an aid to clarity, portability, modularity and maintenance of software and have become a de facto standard for the elementary vector operations.” While the original set included only vector operations, the additions proposed here are matrix and vector operations that occur frequently in mathematical programs. The choice of operations was made after much consultation with workers in the field at meetings during 1984 and 1985. The paper further describes the naming conventions and calling sequences for the subprograms as well as the various matrix storage schemes that may be used. Textbooks always point out the power and utility of matrix-vector notation as an aid to mathematical thought, and systems such as APL have demonstrated its advantages in programming. Now, as the BLAS with these extensions become available on more FORTRAN programming systems, programmers for scientific and engineering applications can also benefit without losing speed or storage efficiency.

        Access critical reviews of Computing literature here

        Become a reviewer for Computing Reviews.

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in

        Full Access

        • Published in

          cover image ACM Transactions on Mathematical Software
          ACM Transactions on Mathematical Software  Volume 14, Issue 1
          March 1988
          111 pages
          ISSN:0098-3500
          EISSN:1557-7295
          DOI:10.1145/42288
          Issue’s Table of Contents

          Copyright © 1988 ACM

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 1 March 1988
          Published in toms Volume 14, Issue 1

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • article

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader