ACM Computing Surveys (CSUR)
Improving locality by critical working sets
Communications of the ACM
Automatic segmentation of cyclic program structures based on connectivity and processor timing
Communications of the ACM
Dynamic space-sharing in computer systems
Communications of the ACM
The working set model for program behavior
Communications of the ACM
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
WSCLOCK—a simple and effective algorithm for virtual memory management
SOSP '81 Proceedings of the eighth ACM symposium on Operating systems principles
Page size in demand-paging systems
SIGME '73 Proceedings of the 1973 ACM SIGME symposium
On the application of a priori knowledge of program structure to the performance of virtual memory computer systems.
Improving the performance of virtual memory computers.
Improving the performance of virtual memory computers.
Design and performance of future virtual memory systems using fast secondary storage
Design and performance of future virtual memory systems using fast secondary storage
Improving the performance of programs in virtual memory systems
Improving the performance of programs in virtual memory systems
Program optimization for instruction caches
ASPLOS III Proceedings of the third international conference on Architectural support for programming languages and operating systems
Achieving high instruction cache performance with an optimizing compiler
ISCA '89 Proceedings of the 16th annual international symposium on Computer architecture
Profile guided code positioning
PLDI '90 Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation
On the conversion of indirect to direct recursion
ACM Letters on Programming Languages and Systems (LOPLAS)
Reducing branch costs via branch alignment
ASPLOS VI Proceedings of the sixth international conference on Architectural support for programming languages and operating systems
SPAID: software prefetching in pointer- and call-intensive environments
Proceedings of the 28th annual international symposium on Microarchitecture
Code layout optimizations for transaction processing workloads
ISCA '01 Proceedings of the 28th annual international symposium on Computer architecture
Profile guided code positioning
ACM SIGPLAN Notices - Best of PLDI 1979-1999
Profile-directed restructuring of operating system code
IBM Systems Journal
Removing the memory limitations of sensor networks with flash-based virtual memory
Proceedings of the 2nd ACM SIGOPS/EuroSys European Conference on Computer Systems 2007
| Hi-index | 0.00 |
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.