ISMM 1998

20 papers

1. A Brief Introduction to Regions · Mads Tofte
2. A Compacting Incremental Collector and its Performance in a Production Quality Compiler · Martin Larose, Marc Feeley
3. A Memory-Efficient Real-Time Non-Copying Garbage Collector · Tian F. Lim, Przemyslaw Pardyak, Brian N. Bershad
4. A Non-Fragmenting NonMmoving, Garbage Collector · Gustavo Rodriguez-Rivera, Michael Spertus, Charles Fiterman
5. A Study of Large Object Spaces · Michael W. Hicks, Luke Hornof, Jonathan T. Moore, Scott Nettles
6. Barrier Techniques for Incremental Tracing · Pekka P. Pirinen
7. Combining Card Marking with Remembered Sets: How to Save Scanning Time · Alain Azagury, Elliot K. Kolodner, Erez Petrank, Zvi Yehudai
8. Comparing Mostly-Copying and Mark-Sweep Conservative Collection · Frederick Smith, J. Gregory Morrisett
9. Compiler Support to Customize the Mark and Sweep Algorithm · Dominique Colnet, Philippe Coucaud, Olivier Zendra
10. Garbage Collection in Generic Libraries · Gor V. Nishanov, Sibylle Schupp
11. Guaranteeing Non-Disruptiveness and Real-Time Deadlines in an Incremental Garbage Collector · Fridtjof Siebert
12. Hierarchical Distributed Reference Counting · Luc Moreau
13. Memory Allocation for Long-Running Server Applications · Per-Åke Larson, Murali Krishnan
14. Memory Management for Prolog with Tabling · Bart Demoen, Konstantinos Sagonas
15. One-Bit Counts between Unique and Sticky · David J. Roth, David S. Wise
16. Portable Run-Time Type Description for Conventional Compilers · Sheetal V. Kakkad, Mark S. Johnstone, Paul R. Wilson
17. The Bits Between The Lambdas: Binary Data in a Lazy Functional Language · Malcolm Wallace, Colin Runciman
18. The Memory Fragmentation Problem: Solved? · Mark S. Johnstone, Paul R. Wilson
19. Using Generational Garbage Collection To Implement Cache-Conscious Data Placement · Trishul M. Chilimbi, James R. Larus
20. Very Concurrent Mark-&-Sweep Garbage Collection without Fine-Grain Synchronization · Lorenz Huelsbergen, Phil Winterbottom