| 2003 |
|---|
| 27 | EE | Scott F. Kaplan,
Yannis Smaragdakis,
Paul R. Wilson:
Flexible reference trace reduction for VM simulations.
ACM Trans. Model. Comput. Simul. 13(1): 1-38 (2003) |
| 26 | EE | Yannis Smaragdakis,
Scott F. Kaplan,
Paul R. Wilson:
The EELRU adaptive replacement algorithm.
Perform. Eval. 53(2): 93-123 (2003) |
| 2000 |
|---|
| 25 | EE | Emery D. Berger,
Kathryn S. McKinley,
Robert D. Blumofe,
Paul R. Wilson:
Hoard: A Scalable Memory Allocator for Multithreaded Applications.
ASPLOS 2000: 117-128 |
| 24 | EE | Yannis Smaragdakis,
Paul R. Wilson:
Performing Replacement in Modem Pools.
USENIX Annual Technical Conference, General Track 2000: 277-292 |
| 1999 |
|---|
| 23 | EE | Sheetal V. Kakkad,
Paul R. Wilson:
Address Translation Strategies in the Texas Persistent Store.
COOTS 1999: 99-114 |
| 22 | EE | Yannis Smaragdakis,
Scott F. Kaplan,
Paul R. Wilson:
EELRU: Simple and Effective Adaptive Page Replacement.
SIGMETRICS 1999: 122-133 |
| 21 | EE | Scott F. Kaplan,
Yannis Smaragdakis,
Paul R. Wilson:
Trace Reduction for Virtual Memory Simulations.
SIGMETRICS 1999: 47-58 |
| 20 | EE | Paul R. Wilson,
Scott F. Kaplan,
Yannis Smaragdakis:
The Case for Compressed Caching in Virtual Memory Systems.
USENIX Annual Technical Conference, General Track 1999: 101-116 |
| 1998 |
|---|
| 19 | EE | Sheetal V. Kakkad,
Mark S. Johnstone,
Paul R. Wilson:
Portable Run-Time Type Description for Conventional Compilers.
ISMM 1998: 146-153 |
| 18 | EE | Mark S. Johnstone,
Paul R. Wilson:
The Memory Fragmentation Problem: Solved?
ISMM 1998: 26-36 |
| 1995 |
|---|
| 17 | | Paul R. Wilson,
Mark S. Johnstone,
Michael Neely,
David Boles:
Dynamic Storage Allocation: A Survey and Critical Review
IWMM 1995: 1-116 |
| 1994 |
|---|
| 16 | EE | Paul R. Wilson,
Sheetal V. Kakkad,
Shubhendu S. Mukherjee:
Anomalies and adaptation in the analysis and development of prepaging policies.
Journal of Systems and Software 27(2): 147-153 (1994) |
| 1993 |
|---|
| 15 | | Vivek Singhal,
Sheetal V. Kakkad,
Paul R. Wilson:
Texas: good, fast, cheap persistence for C++.
OOPS Messenger 4(2): 145-147 (1993) |
| 1992 |
|---|
| 14 | | Paul R. Wilson:
Uniprocessor Garbage Collection Techniques.
IWMM 1992: 1-42 |
| 13 | | Michael S. Lam,
Paul R. Wilson,
Thomas G. Moher:
Object Type Directed Garbage Collection To Improve Locality.
IWMM 1992: 404-425 |
| 12 | EE | Paul R. Wilson,
Michael S. Lam,
Thomas G. Moher:
Caching Considerations for Generational Garbage Collection.
LISP and Functional Programming 1992: 32-42 |
| 11 | EE | Vivek Singhal,
Sheetal V. Kakkad,
Paul R. Wilson:
Texas: An Efficient, Portable Persistent Store.
POS 1992: 11-33 |
| 10 | | Paul R. Wilson,
Barry Hayes:
Garbage collection in object oriented systems.
OOPS Messenger 3(4): 63-71 (1992) |
| 1991 |
|---|
| 9 | | Paul R. Wilson,
Michael S. Lam,
Thomas G. Moher:
Effective ``Static-Graph'' Reorganization to Improve Locality in Garbage-Collected Systems.
PLDI 1991: 177-191 |
| 8 | | Thomas G. Moher,
Paul R. Wilson:
Offsetting Human Limits With Debugging Technoloy - Guest Editors' Introduction.
IEEE Software 8(3): 11-13 (1991) |
| 7 | EE | Paul R. Wilson:
Some issues and strategies in heap management and memory hierarchies.
SIGPLAN Notices 26(3): 45-52 (1991) |
| 1989 |
|---|
| 6 | | Paul R. Wilson,
Thomas G. Moher:
Design of the Opportunistic Garbage Collector.
OOPSLA 1989: 23-35 |
| 5 | | Paul R. Wilson,
Thomas G. Moher:
Demonic Memories for Process Histories.
PLDI 1989: 330-343 |
| 4 | EE | Paul R. Wilson:
A simple bucket-brigade advancement mechanism for generation-bases garbage collection.
SIGPLAN Notices 24(5): 38-46 (1989) |
| 3 | EE | Paul R. Wilson,
Thomas G. Moher:
A "card-marking" scheme for controlling intergenerational references in generation-based garbage collection on stock hardware.
SIGPLAN Notices 24(5): 87-92 (1989) |
| 1988 |
|---|
| 2 | | James A. Wiseman,
Paul R. Wilson:
A Sylvester Theorem for Conic Sections.
Discrete & Computational Geometry 3: 295-305 (1988) |
| 1 | EE | Paul R. Wilson:
Opportunistic garbage collection.
SIGPLAN Notices 23(12): 98-102 (1988) |
