On the Paging Performance of Array Algorithms

TitleOn the Paging Performance of Array Algorithms
Publication TypeJournal Article
Year of Publication1977
AuthorsKS Trivedi
JournalIeee Transactions on Computers
VolumeC-26
Start Page938
Issue10
Pagination938 - 947
Date Published01/1977
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. Copyright © 1977 by The Institute of Electrical and Electronics Engineers, Inc.

DOI10.1109/TC.1977.1674729
Short TitleIeee Transactions on Computers