research-article

Free access

Some programming techniques for processing multi-dimensional matrices in a paging environment

Author:

James L. ElshoffAuthors Info & Claims

AFIPS '74: Proceedings of the May 6-10, 1974, national computer conference and exposition

Pages 185 - 193

https://doi.org/10.1145/1500175.1500214

Published: 06 May 1974 Publication History

PDF eReader

Abstract

Although virtual memory systems are supposed to free the programmer from space management problems, the systems do not always succeed. In fact, programmers find that by ignoring the fact that real core is limited, the cost of executing their programs sometimes makes them unusable, not to mention some of the detrimental effects the program has on the throughput of the overall system. This problem seems to be especially prevalent when large matrices of data are involved. The data are usually referenced in a cyclical pattern and when the entire matrix will not fit in core, the number of page faults encountered during execution is maximized. The focus of this paper is to analyze programming techniques which will reduce the number of page faults in matrix operations and thereby improve program performance.

References

[1]

Sayre, D., Is Automatic "Folding" of Programs Efficient Enough to Displace Manual?," CACM 12, 12 (December 1969), pp. 656--660.

Digital Library

Google Scholar

[2]

Denning, P. J., "The Working Set Model for Program Behavior," CACM, May 1908, pp. 323--333.

Digital Library

Google Scholar

[3]

Belady, L. A., "A Study of Replacement Algorithms for a Virtual Storage Computer," IBM Syst. J. 5, 2, 1966.

Digital Library

Google Scholar

[4]

Coffman, E. G. and L. C. Varian, "Further Experimental Data on the Behavior of Programs in a Paging Environment," CACM 11, 7 July 1968, pp. 471--474.

Digital Library

Google Scholar

[5]

Brawn, B. S., F. G. Gustavson, and E. S. Mankin, "Sorting in a Paging Environment," CACM 13, 8, August 1970, pp. 483--494.

Digital Library

Google Scholar

[6]

Moler, C. B., "Matrix Computations with Fortran and Paging," CACM 15, 4, April 1972, pp. 268--270.

Digital Library

Google Scholar

[7]

Dubrulle, A. A., "Solution of the Complete Symmetric Eigenproblem in a Virtual Memory Environment," IBM J. Res. Dev. 16, 6, November 1972, pp. 612--615.

Digital Library

Google Scholar

[8]

McKellar, A. C. and E. G. Coffman, "Organizing Matrices and Matrix Operations for Paged Memory Systems," CACM 12, 3 March 1969, pp. 153--165.

Digital Library

Google Scholar

[9]

Guertin, R. L., "Programming in a Paging Environment, Datamation, February 1972, pp. 48--55.

Google Scholar

[10]

Guertin, R. L., System/360 Scientific Subroutine Package, Version III, Programmer's Manual, IBM Edition GH20-0205-4, August 1970, White Plains, New York.

Google Scholar

[11]

Guertin, R. L., System/360 Scientific Subroutine Package (PL/I), Program Description and Operations Manual, IBM Edition H20-0586-0, January 1968, White Plains, New York.

Google Scholar

Cited By

View all

Muramatsu HNegishi H(2006)Page replacement algorithm for large‐array manipulationSoftware: Practice and Experience10.1002/spe.438010070810:7(575-587)Online publication date: 27-Oct-2006
https://doi.org/10.1002/spe.4380100708
Innes D(2006)Exploiting the least recently used page replacement algorithmSoftware: Practice and Experience10.1002/spe.43800702177:2(271-273)Online publication date: 27-Oct-2006
https://doi.org/10.1002/spe.4380070217
Chen HLi KWei B(2005)Memory Performance Optimizations For Real-Time Software HDTV DecodingJournal of VLSI Signal Processing Systems10.1007/s11265-005-6650-741:2(193-207)Online publication date: 1-Sep-2005
https://dl.acm.org/doi/10.1007/s11265-005-6650-7
Show More Cited By

Recommendations

Approximate Inverse Techniques for Block-Partitioned Matrices

This paper proposes some preconditioning options when the system matrix is in block-partitioned form. This form may arise naturally, for example, from the incompressible Navier--Stokes equations, or may be imposed after a domain decomposition reordering. ...
Accurate Eigenvalues and SVDs of Totally Nonnegative Matrices

We consider the class of totally nonnegative (TN) matrices---matrices all of whose minors are nonnegative. Any nonsingular TN matrix factors as a product of nonnegative bidiagonal matrices. The entries of the bidiagonal factors parameterize the set of ...
Computing eigenvalues of normal matrices via complex symmetric matrices
Abstract
Computing all eigenvalues of a modest size matrix typically proceeds in two phases. In the first phase, the matrix is transformed to a suitable condensed matrix format, sharing the eigenvalues, and in the second stage the eigenvalues ...

Comments

Information & Contributors

Information

Published In

AFIPS '74: Proceedings of the May 6-10, 1974, national computer conference and exposition

May 1974

1083 pages

ISBN:9781450379205

DOI:10.1145/1500175

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 06 May 1974

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
155
Total Downloads

Downloads (Last 12 months)37
Downloads (Last 6 weeks)8

Reflects downloads up to 07 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Muramatsu HNegishi H(2006)Page replacement algorithm for large‐array manipulationSoftware: Practice and Experience10.1002/spe.438010070810:7(575-587)Online publication date: 27-Oct-2006
https://doi.org/10.1002/spe.4380100708
Innes D(2006)Exploiting the least recently used page replacement algorithmSoftware: Practice and Experience10.1002/spe.43800702177:2(271-273)Online publication date: 27-Oct-2006
https://doi.org/10.1002/spe.4380070217
Chen HLi KWei B(2005)Memory Performance Optimizations For Real-Time Software HDTV DecodingJournal of VLSI Signal Processing Systems10.1007/s11265-005-6650-741:2(193-207)Online publication date: 1-Sep-2005
https://dl.acm.org/doi/10.1007/s11265-005-6650-7
Abu-Sufah WKuck DLawrie D(1981)On the Performance Enhancement of Paging Systems Through Program Analysis and TransformationsIEEE Transactions on Computers10.1109/TC.1981.167579230:5(341-356)Online publication date: 1-May-1981
https://dl.acm.org/doi/10.1109/TC.1981.1675792
Trivedi K(1978)Analytic Modeling of Computer SystemsComputer10.1109/C-M.1978.21794311:10(38-56)Online publication date: 1-Oct-1978
https://dl.acm.org/doi/10.1109/C-M.1978.217943
Trivedi K(1977)On the Paging Performance of Array AlgorithmsIEEE Transactions on Computers10.1109/TC.1977.167472926:10(938-947)Online publication date: 1-Oct-1977
https://dl.acm.org/doi/10.1109/TC.1977.1674729
Browne J(1976)DATA DEFINITION, STRUCTURES, AND MANAGEMENT IN SCIENTIFIC COMPUTINGComputer Science and Scientific Computing10.1016/B978-0-12-528540-7.50006-X(25-56)Online publication date: 1976
https://doi.org/10.1016/B978-0-12-528540-7.50006-X

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

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

Cited By

Recommendations

Approximate Inverse Techniques for Block-Partitioned Matrices

Accurate Eigenvalues and SVDs of Totally Nonnegative Matrices

Computing eigenvalues of normal matrices via complex symmetric matrices

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

Abstract

References

Cited By

Recommendations

Approximate Inverse Techniques for Block-Partitioned Matrices

Accurate Eigenvalues and SVDs of Totally Nonnegative Matrices

Computing eigenvalues of normal matrices via complex symmetric matrices

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Share

Share this Publication link

Share on social media

Affiliations