Static grouping of small objects to enhance performance of a paged virtual memory
ACM Transactions on Computer Systems (TOCS)
Ordering functions for improving memory reference locality in a shared memory multiprocessor system
MICRO 25 Proceedings of the 25th annual international symposium on Microarchitecture
ACM Computing Surveys (CSUR)
Improving locality by critical working sets
Communications of the ACM
A note on storage fragmentation and program segmentation
Communications of the ACM
A Fast and Robust Network Bisection Algorithm
IEEE Transactions on Computers
Bibliography on paging and related topics
ACM SIGOPS Operating Systems Review
Automatic and general solution to the adaptation of programs in a paging environment
SOSP '77 Proceedings of the sixth ACM symposium on Operating systems principles
Multi-processor software lockout
ACM '68 Proceedings of the 1968 23rd ACM national conference
On the Performance Enhancement of Paging Systems Through Program Analysis and Transformations
IEEE Transactions on Computers
AFIPS '68 (Fall, part II) Proceedings of the December 9-11, 1968, fall joint computer conference, part II
An interactive software engineering tool for memory management and user program evaluation
AFIPS '74 Proceedings of the May 6-10, 1974, national computer conference and exposition
OS/VS1 concepts and philosophies
IBM Systems Journal
User program performance in virtual storage systems
IBM Systems Journal
Virtual storage and virtual machine concepts
IBM Systems Journal
Program restructuring for virtual memory
IBM Systems Journal
Lower bounds for the partitioning of graphs
IBM Journal of Research and Development
| Hi-index | 0.04 |
Much attention has been directed to paging algorithms and little to the role of the user in this environment. This paper describes an experiment which is an attempt to determine the significance of efforts by the user to improve the paging characteristics of his program. The problem of throughput in a computing system is primarily one of balancing the flow of data and programs through a hierarchy of storages. The problem is considered solved when for every available processor cycle there is a matching demand for that cycle in the primary (execution) store. Since programs and their data usually originate in a location other than the execution store, there is a delay associated with the movement of data and programs to the primary store. The delay has two components, the operational speed (data transfer time) and the positioning, or access time, of the secondary storage device. Since the access time usually exceeds the data transfer time by an order of magnitude, the problem of transferring information to the primary store has been named the “access gap” problem.