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 :
Array language, compiler, compiler optimization, demand prepaging, locality, matrix algorithm, paging performance, prepaging, submatrix algorithm.; Aging; Computer science; Information analysis; Memory management; Optimizing compilers; Pattern analysis; Programming profession; Array language, compiler, compiler optimization, demand prepaging, locality, matrix algorithm, paging performance, prepaging, submatrix algorithm.;
