Issue No. 11 - November (1988 vol. 14)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/32.9051
<p>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.</p>
storage management; program restructuring; multiprogrammed virtual memory; compiler; virtual address space; compile-time restructuring; instruction-only address traces; optimum space-time; memory allocations; data structures; multiprogramming; performance evaluation; program compilers; storage allocation; storage management; virtual storage
S. Hartley, "Compile-Time Program Restructuring in Multiprogrammed Virtual Memory Systems," in IEEE Transactions on Software Engineering, vol. 14, no. , pp. 1640-1644, 1988.