Powered by
Conference Publishing Consulting

ACM SIGPLAN International Symposium on Memory Management (ISMM 2015), June 14, 2015, Portland, OR, USA

ISMM 2015 – Proceedings

Contents - Abstracts - Authors

ACM SIGPLAN International Symposium on Memory Management (ISMM 2015)

Frontmatter

Title Page
Foreword

Mobile Systems

Controlling Physical Memory Fragmentation in Mobile Systems
Sang-Hoon Kim, Sejun Kwon, Jin-Soo Kim, and Jinkyu Jeong
(KAIST, South Korea; Sungkyunkwan University, South Korea)
Don't Race the Memory Bus: Taming the GC Leadfoot
Ahmed Hussein, Antony L. Hosking, Mathias Payer, and Christopher A. Vick
(Purdue University, USA; Qualcomm, USA)

New Memory Management Algorithms

Data Structure Aware Garbage Collector
Nachshon Cohen and Erez Petrank ORCID logo
(Technion, Israel)
SuperMalloc: A Super Fast Multithreaded Malloc for 64-bit Machines
Bradley C. Kuszmaul
(Massachusetts Institute of Technology, USA)
Concurrent Compaction using a Field Pinning Protocol
Erik Österlund and Welf Löwe
(Linnaeus University, Sweden)

Managed Languages

Stop and Go: Understanding Yieldpoint Behavior
Yi Lin, Kunshan Wang, Stephen M. BlackburnORCID logo, Antony L. Hosking, and Michael Norrish
(Australian National University, Australia; Purdue University, USA; NICTA, Australia)
Safe and Efficient Hybrid Memory Management for Java
Codruţ Stancu, Christian Wimmer ORCID logo, Stefan Brunthaler, Per Larsen, and Michael Franz ORCID logo
(University of California at Irvine, USA; Oracle Labs, USA)
A Partial Read Barrier for Efficient Support of Live Object-Oriented Programming
Eliot Miranda ORCID logo and Clément Béra
(Cadence Design Systems, USA; INRIA, France)
Video
Memento Mori: Dynamic Allocation-Site-Based Optimizations
Daniel Clifford, Hannes Payer, Michael Stanton, and Ben L. Titzer
(Google, Germany)

Optimizing Garbage Collection

Recycling Trash in Cache
Jonathan Shidal, Ari J. Spilo, Paul T. Scheid, Ron K. Cytron, and Krishna M. Kavi
(Washington University at St. Louis, USA; University of North Texas, USA)
Reducing Pause Times with Clustered Collection
Cody Cutler and Robert Morris
(Massachusetts Institute of Technology, USA)
The Judgment of Forseti: Economic Utility for Dynamic Heap Sizing of Multiple Runtimes
Callum Cameron, Jeremy SingerORCID logo, and David Vengerov
(University of Glasgow, UK; Oracle, USA)

proc time: 0.8