ON THE PAGING PERFORMANCE OF ARRAY ALGORITHMS.

Data paging is of primary concern for problems with large data bases and for many types of array problems. It is shown that prepaging reduces the paging problems of array algorithms operating on large arrays. Also shown is that the use of a submatrix algorithm considerably improves the locality. Methods of automating these performance-improvement techniques by means of a compiler in the context of a structured array language are considered.