Dear colleague
We'd like to invite you to join us at the International Symposium on
Memory Management 1998, immediately preceding OOPSLA in Vacouver.
Memory management is becomming more and more important these
days, and the meeting should be a good chance to find out where
it's at, and to meet other researchers in the field. As well as the
formal programme there will be several informal sessions, led
(we hope) by you.
Details below.
Simon Peyton Jones, General Chair
Richard Jones, Program Chair
-----------------------------------------------------------
Call for participation
International Symposium on Memory Management 1998
Sat 17th - Mon 19th October 1998, Vancouver
Sponsored by ACM SIGPLAN
Co-located with OOPSLA
Full details at:
http://www.sfu.ca/~burton/ismm98.html
*****************************************
* YOU CAN REGISTER NOW ON THIS URL *
*****************************************
The International Symposium on Memory Management is a forum for
research in memory management, especially garbage collection and
dynamic storage allocators. Areas of interest include but are not
limited to: garbage collection, dynamic storage allocation, storage
managemeent implementation techniques and their interactions with
language and OS implementation, and empirical studies of programs'
memory allocation and referencing behavior.
Accepted papers
~~~~~~~~~~~~~~~~
A Compacting Incremental Collector and its Performance in a Production
Quality Compiler, Martin Larose and Marc Feeley, Universite de
Montreal
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
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
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
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
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
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
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-Universite
Henri Poincare
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-Ake Larson
and Murali Krishnan, Microsoft
