Paul R. Wilson, Thomas G. Moher
Generation-based garbage collectors must detect references from older generations into younger ones in order to allow the independent scavenging of the younger generations [Lille83]. On stock...
Abstract Address Translation Strategies in the Texas Persistent Store (2008)
Sheetal V. Kakkad, Paul R. Wilson, Sheetal V. Kakkad
Rights to individual papers remain with the author or the author's employer. Permission is granted for noncommercial reproduction of the work for educational or research purposes. This copyright...
Abstract Hoard: A Scalable Memory Allocator for Multithreaded Applications (2008)
Emery D. Berger, Kathryn S. Mckinleyyrobert, D. Blumofe, Paul R. Wilson
Parallel, multithreaded programs such as web servers, database managers, news servers, and scientific applications are becoming increasingly prevalent. For these C and C++ applications, the memory...
Locality of reference is crucial to the performance of modern computers, but is actually poorly understood. In this paper, we survey issues in locality and memory hierarchy design, attempting to...
Basic Garbage Collection Techniques (2007)
Techniques Paul, Paul R. Wilson
Reference Counting In a reference counting system [1], each object has an associated count of the references (pointers) to it. Each time a reference to the object is created, e.g., when a pointer is...
Uniprocessor Garbage Collection Techniques (2007)
Submitted To Acm, Paul R. Wilson
We survey basic garbage collection algorithms, and variations such as incremental and generational collection; we then discuss low-level implementation considerations and the relationships between...
[19] Paul R. Wilson and Thomas G. Moher. Design of the opportunistic garbage collector. In (2007)
Acm Sigplan, Walter R. Smith, Robert V. Well, Hardware In, Paul R. Wilson, Paul R. Wilson, ...
mputing Systems. [27] Paul R. Wilson, Shubhendu S. Mukherjee, and Sheetal V. Kakkad. Anomalies and adaptation in the analysis and development of prepaging policies. Journal of Systems and Software,...
Abstract Trace Reduction for Virtual Memory Simulations (2007)
Scott F. Kaplan, Yannis Smaragdakis, Paul R. Wilson
The unmanageably large size of reference traces has spurred the development of sophisticated trace reduction techniques. In this paper we present twonew algorithms for trace reduction | Safely...
Communications of the ACM, 26(6):419--429, June 1983. (2007)
Walter R. Smith, Robert V. Well, Hardware In, Paul R. Wilson, Paul R. Wilson, Shubhendu S. Mukherjee, ...
[23] Craig Chambers. The Design and Implementation of the SELF Compiler, an Optimizing Compiler
Trace Reduction for Virtual Memory Simulations (2004)
Scott Kaplan Yannis, Scott F. Kaplan, Yannis Smaragdakis, Paul R. Wilson
The unmanageably large size of reference traces has spurred the development of sophisticated trace reduction techniques. In this paper we present two new algorithms for trace reduction --- Safely...
Flexible reference trace reduction for vm simulations (2003)
Scott F. Kaplan, Yannis Smaragdakis, Paul R. Wilson
wilsoncs. utexas. edu The unmanageably large size of reference traces has spurred the development of sophisticated trace reduction techniques. In this paper we present two new algorithms for trace...
Hoard: A Scalable Memory Allocator for Multithreaded Applications (2000)
Emery D. Berger, Kathryn S. McKinley, Robert D. Blumofe, Paul R. Wilson
Parallel, multithreaded C and C++ programs such as web servers, database managers, news servers, and scientific applications are becoming increasingly prevalent. For these applications, the memory...
Hoard: A Scalable Memory Allocator for Multithreaded Applications (2000)
Emery Berger Kathryn, Kathryn S. Mckinley, Robert D. Blumofe, Paul R. Wilson
Parallel, multithreaded C and C++ programs such as web servers, database managers, news servers, and scientific applications are becoming increasingly prevalent. For these applications, the memory...
Hoard: A Scalable Memory Allocator for Multithreaded Applications (2000)
Emery Berger Kathryn, Kathryn S. Mckinley, Robert D. Blumofe, Paul R. Wilson
Parallel, multithreaded programs such as web servers, database managers, news servers, and scientific applications are becoming increasingly prevalent. For these C and C++ applications, the memory...
Trace reduction for virtual memory simulations (1999)
Scott F. Kaplan, Yannis Smaragdakis, Paul R. Wilson
The unmanageably large size of reference traces has spurred the development of sophisticated trace reduction techniques. In this paper we present two new algorithms for trace reduction--- Safely...
The case for compressed caching in virtual memory systems (1999)
Paul R. Wilson, Scott F. Kaplan, Yannis Smaragdakis
Compressed caching uses part of the available RAM to hold pages in compressed form, effectively adding a new level to the virtual memory hierarchy. This level attempts to bridge the huge performance...
The Case for Compressed Caching in Virtual Memory Systems (1999)
Paul R. Wilson, Scott F. Kaplan, Yannis Smaragdakis
Compressed caching uses part of the available RAM to hold pages in compressed form, effectively adding a new level to the virtual memory hierarchy. This level attempts to bridge the huge performance...
The case for compressed caching in virtual memory systems (1999)
Paul R. Wilson, Paul R. Wilson, Scott F. Kaplan, Scott F. Kaplan, Yannis Smaragdakis, Yannis Smaragdakis
reproduction of the work for educational or research purposes. This copyright notice must be included in the reproduced paper. USENIX acknowledges all trademarks herein. For more information about...
The memory fragmentation problem: Solved (1998)
Mark S. Johnstone, Paul R. Wilson
We show that for 8 real and varied C and C++ programs, sev-eral conventional dynamic storage allocators provide nearzero fragmentation, once we account for overheads due to implementation details...
The Memory Fragmentation Problem: Solved (1998)
Mark S. Johnstone, Paul R. Wilson
We show that for 8 real and varied C and C++ programs, several conventional dynamic storage allocators provide nearzero fragmentation, once we account for overheads due to implementation details such...
The Memory Fragmentation Problem: Solved? (1997)
Mark S. Johnstone, Paul R. Wilson
Memory allocation has been an active area of research. A large number of algorithms have been proposed which were at least partly motivated by the belief that fragmentation can be a severe problem...
Portable Run-Time Type Description for Conventional Compilers (1996)
Sheetal Kakkad, Mark S. Johnstone, Paul R. Wilson
Many useful programming language extensions and system support libraries require knowledge of the locations of fields within objects at run time. Examples include orthogonal persistent object stores,...
Dynamic storage allocation: A survey and critical review (1995)
Paul R. Wilson, Mark S. Johnstone, Michael Neely, David Boles
Abstract. Dynamic memory allocation has been a fundamental part of most computer systems since roughly 1960, and memory allocation is widely considered to be either a solved problem or an insoluble...
Dynamic Storage Allocation: A Survey and Critical Review (1995)
Paul R. Wilson, Mark S. Johnstone, Michael Neely, David Boles
. Dynamic memory allocation has been a fundamental part of most computer systems since roughly 1960, and memory allocation is widely considered to be either a solved problem or an insoluble one. In...
Dynamic storage allocation: A survey and critical review (1995)
Paul R. Wilson, Mark S. Johnstone, Michael Neely, David Boles
Abstract. Dynamic memory allocation has been a fundamental part of most computer systems since roughly 1960, and memory allocation is widely considered to be either a solved problem or an insoluble...
Dynamic storage allocation: A survey and critical review. In (1995)
Paul R. Wilson, Mark S. Johnstone, Michael Neely, David Boles
Abstract. Dynamic memory allocation has been a fundamental part of most computer systems since roughly 1960, and memory allocation is widely considered to be either a solved problem or an insoluble...
Uniprocessor garbage collection techniques (1994)
We survey basic garbage collection algorithms, and variations such as incremental and generational collection� we then discuss low-level implementation considerations and the relationships between...
Uniprocessor Garbage Collection Techniques (1992)
Paul Wilson University, Paul R. Wilson
. We survey basic garbage collection algorithms, and variations such as incremental and generational collection. The basic algorithms include reference counting, mark-sweep, mark-compact, copying,...
Uniprocessor Garbage Collection Techniques (1992)
We survey basic garbage collection algorithms, and variations such as incremental and generational collection. The basic algorithms include reference counting, mark-sweep, mark-compact, copying, and...
Uniprocessor Garbage Collection Techniques (1992)
We survey basic garbage collection algorithms, and variations such as incremental and generational collection; we then discuss low-level implementation considerations and the relationships between...
Knowledge of AIDS in Australia: a national study (1988)
Ross, Michael W., Carson, James A., Cass, Vivienne C., Hart, John, Wilson, Paul R.
The level of knowledge of AIDS was assessed by six questions in a geographically stratified random sample of 2601 adults in all states and territories in Australia. Results indicated that knowledge...
Trace Reduction for Virtual Memory Simulations
Scott Kaplan Yannis, Scott F. Kaplan, Yannis Smaragdakis, Paul R. Wilson
The unmanageably large size of reference traces has spurred the development of sophisticated trace reduction techniques. In this paper we present two new algorithms for trace reduction---Safely...
Trace Reduction for Virtual Memory Simulations
Scott Kaplan, Yannis Smaragdakis, Paul R. Wilson
The unmanageably large size of reference traces has spurred the development of sophisticated trace reduction techniques. In this paper we present two new algorithms for trace reduction --- Safely...