Compile-time program restructuring in multiprogrammed virtual memory systems
Stephen J. Hartley · IEEE Transactions on Software Engineering · 1988
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.>
Cited by 35 works. doi:10.1109/32.9051
Authors
References
- A study of replacement algorithms for a virtual-storage computer
- The working set model for program behavior
- The working set model for program behavior
- Virtual memory
- Virtual Memory
- Program restructuring for virtual memory
- Dynamic space-sharing in computer systems
- Improving locality by critical working sets
- Fundamental operational laws of computer system performance
- On the Performance Enhancement of Paging Systems Through Program Analysis and Transformations