MSP/ISMM 2002: Berlin, Germany

MSP 2002

• Chen Ding, Yutao Zhong:
  Compiler-directed run-time monitoring of program data access. 1-12
  
• Chris Lattner, Vikram S. Adve:
  Automatic pool allocation for disjoint data structures. 13-24
  
• Darko Stefanovic, Matthew Hertz, Stephen Blackburn, Kathryn S. McKinley, J. Eliot B. Moss:
  Older-first garbage collection in practice: evaluation in Java Virtual Machine. 25-36
  
• George S. Almasi, Calin Cascaval, David A. Padua:
  Calculating stack distances efficiently. 37-43
  
• Nicholas Nethercote, Alan Mycroft:
  The cache behaviour of large lazy functional programs on stock hardware. 44-55
  
• Ricardo Lopes, Luís Fernando Castro, Vítor Santos Costa:
  From simulation to practice: cache performance study of a Prolog system. 56-64
  
• Chantal Ykman-Couvreur, J. Lambrecht, A. Van Der Togt, Francky Catthoor:
  Multi-ovjective abstract data type refinement for mapping tables in telecom network applications. 65-75
  
• Martin Schulz, Jie Tao, Jürgen Jeitner, Wolfgang Karl:
  A proposal for a new hardware cache monitoring architecture. 76-85
  
• Nihar R. Mahapatra, Jiangjiang Liu, Krishnan Sundaresan:
  The performance advantage of applying compression to the memory system. 86-96
  
• Keith D. Cooper, Li Xu:
  An efficient static analysis algorithm to detect redundant memory operations. 97-107
  

ISMM 2002

Real Time

• Sven Gestegard Robertz:
  Applying priorities to memory allocation. 108-118
  
• Toshio Endo, Kenjiro Taura:
  Reducing pause time of conservative collectors. 119-131
  
• Morgan Deters, Ron Cytron:
  Automated discovery of scoped memory regions for real-time Java. 132-142
  

Empirical Studies of Applications

• Martin Hirzel, Johannes Henkel, Amer Diwan, Michael Hind:
  Understanding the connectivity of heap objects. 143-156
  
• Tony Printezis, Alex Garthwaite:
  Visualising the train garbage collector. 157-170
  
• Ran Shaham, Elliot K. Kolodner, Shmuel Sagiv:
  Estimating the impact of heap liveness information on space consumption in Java. 171-182
  

Concurrency, Parallelism, Distribution

• Tamar Domani, Gal Goldshtein, Elliot K. Kolodner, Ethan Lewis, Erez Petrank, Dafna Sheinwald:
  Thread-local heaps for Java. 183-194
  
• Erik Johansson, Konstantinos F. Sagonas, Jesper Wilhelmsson:
  Heap architectures for concurrent languages using message passing. 195-206
  
• Ori Ben-Yitzhak, Irit Goft, Elliot K. Kolodner, Kean Kuiper, Victor Leikehman:
  An algorithm for parallel incremental compaction. 207-212
  
• Abhay Vardhan, Gul Agha:
  Using passive object garbage collection algorithms for garbage collection of active objects. 213-220
  

Diverse Topics

• Scott F. Kaplan, Lyle A. McGeoch, Megan F. Cole:
  Adaptive caching for demand prepaging. 221-232
  
• Feng Qian, Laurie J. Hendren:
  An adaptive, region-based allocator for java. 233-244
  
• Sanjeev Kumar, Kai Li:
  Dynamic memory management for programmable devices. 245-255
  

Implemention Techniques

• Fergus Henderson:
  Accurate garbage collection in an uncooperative environment. 256-263
  
• Aneesh Aggarwal:
  Software caching vs. prefetching. 263-268
  
• David Dice, Alex Garthwaite:
  Mostly lock-free malloc. 269-280
  
• Stephen Blackburn, Kathryn S. McKinley:
  In or out?: putting write barriers in their place. 281-290
  

Last update Mon May 20 15:29:49 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page