ACM Computing Surveys (CSUR)
Sorting in a paging environment
Communications of the ACM
The working set model for program behavior
Communications of the ACM
An anomaly in space-time characteristics of certain programs running in a paging machine
Communications of the ACM
Efficient partitioning of components
DAC '68 Proceedings of the 5th annual Design Automation Workshop
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
Automatic program segmentation based on Boolean connectivity
AFIPS '71 (Spring) Proceedings of the May 18-20, 1971, spring joint computer conference
Very Large Scale Spatial Computing
UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation
On the Performance Enhancement of Paging Systems Through Program Analysis and Transformations
IEEE Transactions on Computers
On the Paging Performance of Array Algorithms
IEEE Transactions on Computers
Linux Kernel Compaction through Cold Code Swapping
Transactions on High-Performance Embedded Architectures and Compilers II
A hardware/software framework for instruction and data scratchpad memory allocation
ACM Transactions on Architecture and Code Optimization (TACO)
Studying microarchitectural structures with object code reordering
Proceedings of the Workshop on Binary Instrumentation and Applications
| Hi-index | 0.01 |
Program reference patterns can have a more profound effect on paging performance in a virtual memory system than page replacement algorithms. This paper describes experimental techniques that can significantly reduce paging exceptions in existing, frequently executed programs. Automated procedures reorder relocatable program sectors, and computer displays of memory usage facilitate further optimization of program structure.