Properties of the working-set model
Communications of the ACM
Matrix computations with Fortran and paging
Communications of the ACM
Dynamic partitioning for array languages
Communications of the ACM
Organizing matrices and matrix operations for paged memory systems
Communications of the ACM
Operating Systems Theory
A tool for automatic program restructuring
ACM '73 Proceedings of the ACM annual conference
Automatic recognition of vector and parallel operations in a higher level language
ACM '72 Proceedings of the ACM annual conference - Volume 2
Dynamic program behavior under paging
ACM '66 Proceedings of the 1966 21st national conference
ACM '66 Proceedings of the 1966 21st national conference
Parallelism exposure and exploitation in programs
Parallelism exposure and exploitation in programs
Prepaging and applications to structured array problems.
Prepaging and applications to structured array problems.
The multics system: an examination of its structure
The multics system: an examination of its structure
Prepaging and Applications to Array Algorithms
IEEE Transactions on Computers
AFIPS '68 (Fall, part II) Proceedings of the December 9-11, 1968, fall joint computer conference, part II
Some programming techniques for processing multi-dimensional matrices in a paging environment
AFIPS '74 Proceedings of the May 6-10, 1974, national computer conference and exposition
Program restructuring for virtual memory
IBM Systems Journal
Solution of the complete symmetric eigenproblem in a virtual memory environment
IBM Journal of Research and Development
Evaluation techniques for storage hierarchies
IBM Systems Journal
On-line measurement of paging behavior by the multivalued MIN algorithm
IBM Journal of Research and Development
On the Performance Enhancement of Paging Systems Through Program Analysis and Transformations
IEEE Transactions on Computers
Post-copy based live virtual machine migration using adaptive pre-paging and dynamic self-ballooning
Proceedings of the 2009 ACM SIGPLAN/SIGOPS international conference on Virtual execution environments
Post-copy live migration of virtual machines
ACM SIGOPS Operating Systems Review
Sprint: speculative prefetching of remote data
Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications
| Hi-index | 14.98 |
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.