Matrix computations with Fortran and paging

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Matrix computations with Fortran and paging

Full text

Pdf (271 KB)

Source

Communications of the ACM archive
Volume 15 , Issue 4 (April 1972) table of contents

Pages: 268 - 270

Year of Publication: 1972

ISSN:0001-0782

Author

Cleve B. Moler

Univ. of Michigan, Ann Arbor

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 15, Downloads (12 Months): 95, Citation Count: 16

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/361284.361297 What is a DOI?

ABSTRACT

The efficiency of conventional Fortran programs for matrix computations can often be improved by reversing the order of nested loops. Such modifications produce modest savings in many common situations and very significant savings for large problems run under an operating system which uses paging.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Forsythe, G., and Moler, C.B. Computer Solution of Linear Algebraic Systems. Prentice-Hall, Englewood Cliffs, N.J., 1967.
	2	S. Gorn, FORTRAN vs. Basic FORTRAN: a programming language for informational processing on automatic data processing systems, Communications of the ACM, v.7 n.10, p.591-624, Oct. 1964 [doi>10.1145/364888.876694]
	3	A. C. McKellar , E. G. Coffman, Jr., Organizing matrices and matrix operations for paged memory systems, Communications of the ACM, v.12 n.3, p.153-165, March 1969 [doi>10.1145/362875.362879]
	4	B. W. Arden , B. A. Galler , T. C. O'Brien , F. H. Westervelt, Program and Addressing Structure in a Time-Sharing Environment, Journal of the ACM (JACM), v.13 n.1, p.1-16, Jan. 1966 [doi>10.1145/321312.321313]
	5	B. Randell , C. J. Kuehner, Dynamic storage allocation systems, Communications of the ACM, v.11 n.5, p.297-306, May 1968 [doi>10.1145/363095.363138]
	6	Moler, Cleve B. Algorithm 423, Linear equation solver. Comm. ACM 15, 4 (Apr. 1972), 274.

CITED BY 16

	Patrick C. Fischer , Robert L. Probert, A note on matrix multiplication in a paging environment, Proceedings of the annual conference, p.17-21, October 20-22, 1976, Houston, Texas, United States
	Alok Aggarwal , Ashok Chandra, Virtual memory algorithms, Proceedings of the twentieth annual ACM symposium on Theory of computing, p.173-185, May 02-04, 1988, Chicago, Illinois, United States
	Thomas J. Aird , Edward L. Battiste , Walton C. Gregory, Portability of Mathematical Software Coded in Fortran, ACM Transactions on Mathematical Software (TOMS), v.3 n.2, p.113-127, June 1977
	Patrick C. Fischer , Robert L. Probert, Storage reorganization techniques for matrix computation in a paging environment, Communications of the ACM, v.22 n.7, p.405-415, July 1979
	J. J. Du Croz , S. M. Nugent , J. K. Reid , D. B. Taylor, Solving Large Full Sets of Linear Equations in a Paged Virtual Store, ACM Transactions on Mathematical Software (TOMS), v.7 n.4, p.527-536, Dec. 1981
	Robert W. Taylor , Randall L. Frank, CODASYL Data-Base Management Systems, ACM Computing Surveys (CSUR), v.8 n.1, p.67-103, March 1976
	R. J. Lipton , S. C. Eisenstat , R. A. DeMillo, Space and Time Hierarchies for Classes of Control Structures and Data Structures, Journal of the ACM (JACM), v.23 n.4, p.720-732, Oct. 1976
	B. N. Parlett , Y. Wang, The Influence of the Compiler on the Cost of Mathematical Software—in Particular on the Cost of Triangular Factorization, ACM Transactions on Mathematical Software (TOMS), v.1 n.1, p.35-46, March 1975
	James M. Boyle, Extending reliability (Extended Abstract>: Transformational tailoring of abstract mathematical software, ACM SIGNUM Newsletter, v.14 n.1, p.57-60, March 1979
	Michael W. Condry, Paging as a "language processing" task, Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.63-76, January 26-28, 1981, Williamsburg, Virginia
	Donald D. Chamberlin, Relational Data-Base Management Systems, ACM Computing Surveys (CSUR), v.8 n.1, p.43-66, March 1976
	I. Barrodale , G. F. Stuart, Algorithm 576: A FORTRAN Program for Solving Ax=b[F4], ACM Transactions on Mathematical Software (TOMS), v.7 n.3, p.391-397, Sept. 1981
	E. L. Battiste, Mathematical software patterns, ACM SIGNUM Newsletter, v.10 n.1, p.17-20, January 1975
	A. Park , K. Balasubramanian , R. J. Lipton, Array Access Bounds for Block Storage Memory Systems, IEEE Transactions on Computers, v.38 n.6, p.909-913, June 1989
	V. Kevin M. Whitney, Algorithm 422: minimal spanning tree [H], Communications of the ACM, v.15 n.4, p.273-274, April 1972
	James L. Elshoff, Some programming techniques for processing multi-dimensional matrices in a paging environment, Proceedings of the May 6-10, 1974, national computer conference and exposition, May 06-10, 1974, Chicago, Illinois

INDEX TERMS

Keywords:
Fortran, array processing, linear equations, matrix algorithms, paged memory, virtual memory

Collaborative Colleagues:

Cleve B. Moler: colleagues

Adobe Acrobat

QuickTime

Windows Media Player

Real Player