The 1998 International Symposium on Memory Management
	Vancouver, British Columbia, Canada 17-19 October 1998

Sponsored by SIGPLAN Co-located with OOPSLA

ISMM '98 Programme

The ISMM '98 programme consists of 19 technical papers, two invited speakers and two informal sessions. Continuing the tradition of the International Workshops on Memory Management held in St Malo, France in 1992, and Kinross, Scotland in 1995, the papers cover a broad spectrum of memory management concerns, from cache conscious data placement to garbage collection for distributed systems, written by authors from academia and industry.

I would like to express my appreciation to the authors of submitted papers, the programme committee members, the external referees, and the many others who have contributed to the ISMM '98 technical programme. We hope that the resulting technical programme is another solid step towards advancing memory management technology.

Saturday 17 October 1998

8:30-9:00 Welcome and Introduction

9:00-10:00 Invited Speaker

10:20-12:20 Session I

Combining Card Marking with Remembered Sets: How to Save Scanning Time, Alain Azagury, Eliot Kolodner, Erez Petrank and Zvi Yehudai, IBM Haifa Research Laboratory

Barrier techniques for Incremental Tracing, Pekka P. Pirinen, Harlequin

13:50-15:10 Session II

The Memory Fragmentation Problem: Solved?, Mark S. Johnstone and Paul R.Wilson, University of Texas at Austin

Using Generational Garbage Collection to Implement Cache-Conscious Data Placement, Trishul M. Chilimbi and James R. Larus, University of Wisconsin-Madison

15:30-16:50 Session III

One-bit Counts between Unique and Sticky, David J. Roth and David S. Wise, Indiana University

Hierarchical Distributed Reference Counting, Luc Moreau, University of Southampton

Sunday 18 October 1998

9:00-10:00 Informal Presentations I

10:20-12:20 Session IV

Comparing Mostly-Copying and Mark-Sweep Conservative Collection, Frederick Smith and Greg Morrisett, Cornell University

A Non-Fragmenting Non-Copying Garbage Collector, Gustavo Rodriguez-Rivera, Michael Spertus and Charles Fiterman, Geodesic Systems

Garbage Collection in Generic Libraries, Gor V. Nishanov and Sibylle Schupp, Rensselaer Polytechnic Institute

13:50-15:10 Session V

Memory Management for Prolog with Tabling, Bart Demoen and Konstantinos Sagonas, Katholieke Universiteit Leuven

The Bits Between the Lambdas - Binary Data in a Lazy Functional Language, Malcolm Wallace and Colin Runciman, University of York

15:30-16:50 Session VI

A Memory-Efficient Real-Time Non-Copying Garbage Collector, Tian F. Lim, Prsemyslaw Pardyak and Brian N. Bershad, University of Washington

Guaranteeing Non-Disruptiveness and Real-Time Deadlines in an Incremental Garbage Collector, Fridtjof Siebert, Open Group Research Institute, Grenoble

18:00 - 19:30 Reception

Monday 19 October 1998

9:00-10:00 Panel on Finalisation

10:20-12:20 Session VII

A Study of Large Object Spaces, Michael W. Hicks, Luke Hornof, Jonathan T. Moore and Scott M. Nettles, University of Pennsylvania

Portable Run-Time Type Description for Conventional Compilers, Sheetal V. Kakkad, Mark S. Johnstone and Paul R. Wilson, University of Texas at Austin and Somerset Design Center, Motorola Inc.

Compiler Support to Customize the Mark and Sweep Algorithm, Dominique Colnet, Philippe Coucaud and Olivier Zendra, INRIA-CNRS-Université Henri Poincaré

13:50-15:10 Informal Presentations II

15:30-16:50 Session VII

Very Concurrent Mark-&-Sweep Garbage Collection without Fine-Grain Synchronization, Lorenz Huelsbergen and Phil Winterbottom, Bell Laboratories

Memory Allocation for Long-Running Server Applications, Per-Åke Larson and Murali Krishnan, Microsoft

Informal Presentations