ISMM is a forum for research in memory management. ISMM 2015 will be co-located with PLDI 2015 at FCRC 2015.

You're viewing the program in a time zone which is different from your device's time zone - change time zone

Sun 14 Jun

Displayed time zone: Tijuana, Baja California change

10:10 - 11:00
Mobile SystemsResearch Papers at C123
Chair(s): Hans-J. Boehm Google
10:10
25m
Talk
Controlling Physical Memory Fragmentation in Mobile Systems
Research Papers
Sang-Hoon Kim Korea Advanced Institute of Science and Technology, Sejun Kwon Sungkyunkwan University, Jin-Soo Kim Sungkyunkwan University, Jinkyu Jeong Sungkyunkwan University
Link to publication
10:35
25m
Talk
Don't race the memory bus: Taming the GC leadfoot
Research Papers
Ahmed Hussein Purdue University, Tony Hosking Purdue University, Mathias Payer Purdue University, Christopher A. Vick Qualcomm
Link to publication
11:20 - 12:35
New Memory Management AlgorithmsResearch Papers at C123
Chair(s): Jeremy Singer University of Glasgow
11:20
25m
Talk
Data Structure Aware Garbage Collector
Research Papers
Nachshon Cohen Technion, Erez Petrank Technion
Link to publication
11:45
25m
Talk
SuperMalloc: A Super Fast Multithreaded malloc() for 64-bit Machines
Research Papers
Link to publication
12:10
25m
Talk
Concurrent Compaction using a Field Pinning Protocol
Research Papers
Erik Österlund Linnaeus University, Sweden, Welf Löwe Linnaeus University
Link to publication
14:00 - 15:40
Managed LanguagesResearch Papers at C123
Chair(s): Zheng Zhang Rutgers University
14:00
25m
Talk
Stop and Go: Understanding Yieldpoint Behavior
Research Papers
Yi Lin Australian National University, Kunshan Wang Australian National University, Steve Blackburn Australian National University , Tony Hosking Purdue University, Michael Norrish NICTA
Link to publication
14:25
25m
Talk
Safe and Efficient Hybrid Memory Management for Java
Research Papers
Codrut Stancu University of California, Irvine & Oracle Labs, Christian Wimmer Oracle Labs, Stefan Brunthaler University of California, Irvine, Per Larsen University of California, Irvine, Michael Franz University of California, Irvine
Link to publication
14:50
25m
Talk
A Partial Read Barrier for Efficient Support of Live Object-oriented Programming
Research Papers
Eliot Miranda Cadence Design Systems, Clément Béra RMOD - INRIA Lille Nord Europe
Link to publication
15:15
25m
Talk
Memento Mori: Dynamic Allocation-Site-Based Optimizations
Research Papers
Link to publication
16:00 - 17:15
Optimizing Garbage CollectionResearch Papers at C123
Chair(s): Richard Jones University of Kent
16:00
25m
Talk
Recycling Trash in Cache
Research Papers
Jonathan Shidal Washington University, Ari J. Spilo Washington University, Paul T. Scheid Washington University, Ron K. Cytron Washington University, Krishna M. Kavi University of North Texas
Link to publication
16:25
25m
Talk
Reducing Pause Times With Clustered Collection
Research Papers
Link to publication
16:50
25m
Talk
The Judgment of Forseti: Economic Utility for Dynamic Heap Sizing of Multiple Runtimes
Research Papers
Callum Cameron University of Glasgow, Jeremy Singer University of Glasgow, David Vengerov Oracle
Link to publication

Call for Papers

Areas of interest include but are not limited to:

  • Memory allocation and de-allocation
  • Garbage Collection algorithms and implementations
  • Compiler analyses and tools to aid memory management
  • Empirical analysis of heap intensive programs
  • Formal analysis and verification of heap intensive programs
  • Memory system design and analysis
  • Verification of memory management algorithms
  • Memory management for new or non-traditional systems
  • Development and evaluation of open-source implementations related to memory management

ISMM solicits both full-length and short submissions covering new work on these topics, as well as papers presenting confirmations or refutations of important prior results. Surveys and comparative analyses that shed new light on previously published techniques are also welcome. Short submissions may also be work-in-progress or vision papers.

A printable PDF version of the call for papers is here.

A plain text version of the call for papers is here.

Submission Instructions

The submission site is here: https://ismm15.hotcrp.com/

Submissions must be in English, formatted for US Letter (8.5 x 11 inches) paper in standard ACM SIGPLAN conference format: two columns, 10-point font (or larger) on a 10-point baseline (or larger), with columns 20pc (3.33in) wide and 54pc (9in) tall, and a column gutter of 2pc (0.33in).

Full-length submissions must be no more than 11 pages (not including bibliography and well-marked appendices). Short submissions must be no more than 5 pages (not including bibliography and well-marked appendices).

Detailed formatting guidelines are available at the URL below, along with formatting templates or style files for LaTeX:

http://www.acm.org/sigs/sigplan/authorInformation.htm (make sure to enable the 10-pt font, not the default 9-pt font)

Appendices may include additional details such as proofs or experiments, and/or reviews from prior submission(s). Appendices must be anonymized.

Papers should be self-contained and auxiliary material will not be accepted. Papers that violate these guidelines will be rejected by the program chair. Reviewers are not required to read appendices, and so a paper should be intelligible without them. All accepted papers will appear in the published proceedings.

Review Process

The ISMM review process will be double blind so that author anonymity is preserved, in order to avoid bias. Authors must omit author information from their submissions, and they must refer to prior work by themselves in the third person.

The principal criteria for acceptance are scientific merit, innovation, readability, and relevance. As in previous years, ISMM 2015 will use a separate External Review Committee (ERC) to complement the main Program Committee (PC), providing expertise in specific areas and avoiding the need for ad-hoc outside reviewers.

Authors will have the opportunity to respond to reviews during a short response period. Responses are expected to be succinct and limited to correcting factual errors and answering specific questions from the reviews. The committee may choose to address responses or revise reviews, but is not obligated to do so.

Papers previously published or already being reviewed by another conference are not eligible. If a closely related paper has been submitted to a journal, the authors must notify the program chair (see the SIGPLAN republication policy). The submission deadline for ISMM is chosen to be shortly after the author notification deadline for PLDI to allow for authors of relevant papers not accepted for PLDI to resubmit them to ISMM.

Publication

Authors of accepted papers will be required to sign an ACM copyright release or license for ACM to publish their paper in the ACM Digital Library.

AUTHORS TAKE NOTE: All accepted papers will be available in the ACM Digital Library as early as May 30, 2015. The official publication date is the date the proceedings are made available in the ACM Digital Library. The official publication date affects the deadline for any patent filings related to published work.

Accepted Papers

Title
A Partial Read Barrier for Efficient Support of Live Object-oriented Programming
Research Papers
Link to publication
Concurrent Compaction using a Field Pinning Protocol
Research Papers
Link to publication
Controlling Physical Memory Fragmentation in Mobile Systems
Research Papers
Link to publication
Data Structure Aware Garbage Collector
Research Papers
Link to publication
Don't race the memory bus: Taming the GC leadfoot
Research Papers
Link to publication
Memento Mori: Dynamic Allocation-Site-Based Optimizations
Research Papers
Link to publication
Recycling Trash in Cache
Research Papers
Link to publication
Reducing Pause Times With Clustered Collection
Research Papers
Link to publication
Safe and Efficient Hybrid Memory Management for Java
Research Papers
Link to publication
Stop and Go: Understanding Yieldpoint Behavior
Research Papers
Link to publication
SuperMalloc: A Super Fast Multithreaded malloc() for 64-bit Machines
Research Papers
Link to publication
The Judgment of Forseti: Economic Utility for Dynamic Heap Sizing of Multiple Runtimes
Research Papers
Link to publication