Paul R. Wilson

Affiliations:
  • University of Texas at Austin, TX, USA
  • University of Illinois at Chicago, Software Systems Laboratory, IL, USA


According to our database1, Paul R. Wilson authored at least 27 papers between 1988 and 2003.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2003
Flexible reference trace reduction for VM simulations.
ACM Trans. Model. Comput. Simul., 2003

The EELRU adaptive replacement algorithm.
Perform. Evaluation, 2003

2000
Performing Replacement in Modem Pools.
Proceedings of the General Track: 2000 USENIX Annual Technical Conference, 2000

Hoard: A Scalable Memory Allocator for Multithreaded Applications.
Proceedings of the ASPLOS-IX Proceedings of the 9th International Conference on Architectural Support for Programming Languages and Operating Systems, 2000

1999
The Case for Compressed Caching in Virtual Memory Systems.
Proceedings of the 1999 USENIX Annual Technical Conference, 1999

EELRU: Simple and Effective Adaptive Page Replacement.
Proceedings of the 1999 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, 1999

Trace Reduction for Virtual Memory Simulations.
Proceedings of the 1999 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, 1999

Address Translation Strategies in the Texas Persistent Store.
Proceedings of the 5th USENIX Conference on Object-Oriented Technologies & Systems, 1999

1998
Portable Run-Time Type Description for Conventional Compilers.
Proceedings of the International Symposium on Memory Management, 1998

The Memory Fragmentation Problem: Solved?
Proceedings of the International Symposium on Memory Management, 1998

1995
Dynamic Storage Allocation: A Survey and Critical Review
Proceedings of the Memory Management, 1995

1994
Anomalies and adaptation in the analysis and development of prepaging policies.
J. Syst. Softw., 1994

1992
Texas: good, fast, cheap persistence for C++.
Proceedings of the Addendum to the Proceedings on Object-Oriented Programming Systems, 1992

Texas: An Efficient, Portable Persistent Store.
Proceedings of the Persistent Object Systems, 1992

Caching Considerations for Generational Garbage Collection.
Proceedings of the Conference on Lisp and Functional Programming, 1992

Uniprocessor Garbage Collection Techniques.
Proceedings of the Memory Management, 1992

Object Type Directed Garbage Collection To Improve Locality.
Proceedings of the Memory Management, 1992

1991
Offsetting Human Limits With Debugging Technoloy - Guest Editors' Introduction.
IEEE Softw., 1991

Some issues and strategies in heap management and memory hierarchies.
ACM SIGPLAN Notices, 1991

Pointer swizzling at page fault time: efficiently supporting huge address spaces on standard hardware.
SIGARCH Comput. Archit. News, 1991

Garbage collection in object oriented systems.
Proceedings of the Addendum to the proceedings on Object-oriented programming Systems, 1991

Effective "Static-Graph" Reorganization to Improve Locality in Garbage-Collected Systems.
Proceedings of the ACM SIGPLAN'91 Conference on Programming Language Design and Implementation (PLDI), 1991

1989
A "card-marking" scheme for controlling intergenerational references in generation-based garbage collection on stock hardware.
ACM SIGPLAN Notices, 1989

A simple bucket-brigade advancement mechanism for generation-bases garbage collection.
ACM SIGPLAN Notices, 1989

Demonic Memories for Process Histories.
Proceedings of the ACM SIGPLAN'89 Conference on Programming Language Design and Implementation (PLDI), 1989

Design of the Opportunistic Garbage Collector.
Proceedings of the Conference on Object-Oriented Programming: Systems, 1989

1988
Opportunistic garbage collection.
ACM SIGPLAN Notices, 1988


  Loading...