On the Paging Performance of Array Algorithms

1 October 1977

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers

Vol. C-26 (10) , 938-947
https://doi.org/10.1109/tc.1977.1674729

Abstract

Data paging is of primary concern for problems with large data bases and for many types of array problems. We show that prepaging reduces the paging problems of array algorithms operating on large arrays. We also show that the use of a submatrix algorithm considerably improves the locality. Finally, we consider methods of automating these performance-improvement techniques by means of a compiler in the context of a structured array language.

Keywords

This publication has 14 references indexed in Scilit:

Prepaging and Applications to Array Algorithms
IEEE Transactions on Computers, 1976
Some programming techniques for processing multi-dimensional matrices in a paging environment
Published by Association for Computing Machinery (ACM) ,1974
On-line Measurement of Paging Behavior by the Multivalued MIN Algorithm
IBM Journal of Research and Development, 1974
A tool for automatic program restructuring
Published by Association for Computing Machinery (ACM) ,1973
Solution of the Complete Symmetric Eigenproblem in a Virtual Memory Environment
IBM Journal of Research and Development, 1972
Properties of the working-set model
Communications of the ACM, 1972
Program restructuring for virtual memory
IBM Systems Journal, 1971
An analysis of paging and program behaviour
The Computer Journal, 1970
Demand paging in perspective
Published by Association for Computing Machinery (ACM) ,1968
Analysis of Programs for Parallel Processing
IEEE Transactions on Electronic Computers, 1966