Anomalies with variable partition paging algorithms
Communications of the ACM
Characteristics of program localities
Communications of the ACM
Organizing matrices and matrix operations for paged memory systems
Communications of the ACM
The working set model for program behavior
Communications of the ACM
Structure of Computers and Computations
Structure of Computers and Computations
A study of program locality and lifetime functions
SOSP '75 Proceedings of the fifth ACM symposium on Operating systems principles
A study of the effect of user program optimization in a paging system
SOSP '67 Proceedings of the first ACM symposium on Operating System Principles
Control and data dependence for program transformations.
Control and data dependence for program transformations.
Improving the performance of virtual memory computers.
Improving the performance of virtual memory computers.
Speedup of ordinary programs
The Improvement of Program Behavior
Computer
A Modified Working Set Paging Algorithm
IEEE Transactions on Computers
Prepaging and Applications to Array Algorithms
IEEE Transactions on Computers
Time and Parallel Processor Bounds for Fortran-Like Loops
IEEE Transactions on Computers
On the Paging Performance of Array Algorithms
IEEE Transactions on Computers
Thrashing: its causes and prevention
AFIPS '68 (Fall, part I) Proceedings of the December 9-11, 1968, fall joint computer conference, part I
The page fault frequency replacement algorithm
AFIPS '72 (Fall, part I) Proceedings of the December 5-7, 1972, fall joint computer conference, part I
The design of IBM OS/VS2 release 2
AFIPS '73 Proceedings of the June 4-8, 1973, national computer conference and exposition
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
A study of replacement algorithms for a virtual-storage computer
IBM Systems Journal
Improving the Performance of Out-of-Core Computations
ICPP '97 Proceedings of the international Conference on Parallel Processing
A Loop Transformation Algorithm Based on Explicit Data Layout Representation for Optimizing Locality
LCPC '98 Proceedings of the 11th International Workshop on Languages and Compilers for Parallel Computing
Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming
Transforming the adaptive irregular out-of-core applications for hiding communication and disk I/O
OTM'07 Proceedings of the 2007 OTM confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part II
A parallel numerical solver using hierarchically tiled arrays
LCPC'10 Proceedings of the 23rd international conference on Languages and compilers for parallel computing
Optimizing matrix multiplication with a classifier learning system
LCPC'05 Proceedings of the 18th international conference on Languages and Compilers for Parallel Computing
Embedded Systems Design
Hierarchical overlapped tiling
Proceedings of the Tenth International Symposium on Code Generation and Optimization
| Hi-index | 14.98 |
It is possible to improve the paging performance of a program by applying transformations to the source program that improve data access locality. We discuss this subject in general terms, including automation of these transformations, and present a number of such transforms. This is followed by experimental results which indicate that these transformations are indeed effective. Use of practical, simple memory management policies like the fixed allocation local lru replacement algorithm leads to average improvements over untransformed programs of a factor of 10 in space-time cost, and a factor of 5 in memory size. Multiprogramming questions are also discussed.