IEEE Transactions on Software Engineering · 1988 · 35 citations · 20 references
ComputingComputer EngineeringComputer ScienceCompilersComputer ArchitectureOperating SystemsMemory ManagementPerformance OptimizationVirtual MemoryAddress Space ManagementAddress Space MappingCompile-time OptimizationCompiler DesignMemory Allocation OverheadVirtual Address SpaceVirtual Memory ManagementVirtual Memory Systems
An evaluation is made of a way to reduce the cost of program restructuring by having a compiler determine the program's packing in virtual address space from an analysis of its source code. Two features of this method are the duplication of code modules in virtual address space and the inline substitution of the code for a called procedure. This compile-time restructuring algorithm is evaluated using the instruction-only address traces from a collection of programs. In a simulation of a virtual memory system using disks as secondary storage devices, the method is not successful, since it leads to a higher optimum space-time execution cost than that of the unrestructured program. The algorithm did reduce program space-time execution cost for some arbitrarily chosen memory allocations smaller than the optimum. This could be useful in a multiuser, multiprogrammed environment.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
20
A study of replacement algorithms for a virtual-storage computer
L. A. Belady · IBM Systems Journal · 1966 · 1.7K citations
The working set model for program behavior
Peter J. Denning · Communications of the ACM · 1983 · 853 citations · Full text
The working set model for program behavior
Peter J. Denning · Communications of the ACM · 1968 · 652 citations · Full text
Program restructuring for virtual memory
D. J. Hatfield, J. Gerald · IBM Systems Journal · 1971 · 167 citations
Dynamic space-sharing in computer systems
L. A. Belady, C. J. Kuehner · Communications of the ACM · 1969 · 130 citations · Full text