Garbage collection can be faster than stack allocation
Information Processing Letters
Proc. of a conference on Functional programming languages and computer architecture
Simple generational garbage collection and fast allocation
Software—Practice & Experience
A real-time garbage collector based on the lifetimes of objects
Communications of the ACM
A nonrecursive list compacting algorithm
Communications of the ACM
The working set model for program behavior
Communications of the ACM
A LISP garbage-collector for virtual-memory computer systems
Communications of the ACM
LFP '92 Proceedings of the 1992 ACM conference on LISP and functional programming
Scheduling a mixed interactive and batch workload on a parallel, shared memory supercomputer
Proceedings of the 1992 ACM/IEEE conference on Supercomputing
Tools for the development of application-specific virtual memory management
OOPSLA '93 Proceedings of the eighth annual conference on Object-oriented programming systems, languages, and applications
Controlling garbage collection and heap growth to reduce the execution time of Java applications
OOPSLA '01 Proceedings of the 16th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Automatic heap sizing: taking real memory into account
Proceedings of the 4th international symposium on Memory management
Garbage collection without paging
Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation
Program-level adaptive memory management
Proceedings of the 5th international symposium on Memory management
Controlling garbage collection and heap growth to reduce the execution time of Java applications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Isla Vista Heap Sizing: Using Feedback to Avoid Paging
Proceedings of the International Symposium on Code Generation and Optimization
Application-controlled file caching policies
USTC'94 Proceedings of the USENIX Summer 1994 Technical Conference on USENIX Summer 1994 Technical Conference - Volume 1
CRAMM: virtual memory support for garbage-collected applications
OSDI '06 Proceedings of the 7th symposium on Operating systems design and implementation
The economics of garbage collection
Proceedings of the 2010 international symposium on Memory management
Waste not, want not: resource-based garbage collection in a shared environment
Proceedings of the international symposium on Memory management
Application level ballooning for efficient server consolidation
Proceedings of the 8th ACM European Conference on Computer Systems
Control theory for principled heap sizing
Proceedings of the 2013 international symposium on memory management
| Hi-index | 0.00 |
The traditional model of virtual memory working sets does not account for programs that can adjust their working sets on demand. Examples of such programs are garbage-collected systems and databases with block cache buffers. We present a memory-use model of such systems, and propose a method that may be used by virtual memory managers to advise programs on how to adjust their working sets. Our method tries to minimize memory contention and ensure better overall system response time. We have implemented a memory “advice server” that runs as a non-privileged process under Berkeley Unix. User processes may ask this server for advice about working set sizes, so as to take maximum advantage of memory resources. Our implementation is quite simple, and has negligible overhead, and experimental results show that it results in sizable performance improvements.