skip to main content
10.1145/2754169acmconferencesBook PagePublication PagesismmConference Proceedingsconference-collections
ISMM '15: Proceedings of the 2015 International Symposium on Memory Management
ACM2015 Proceeding
Publisher:
  • Association for Computing Machinery
  • New York
  • NY
  • United States
Conference:
ISMM '15: International Symposium on Memory Management Portland OR USA 14 June 2015
ISBN:
978-1-4503-3589-8
Published:
14 June 2015
Sponsors:
Recommend ACM DL
ALREADY A SUBSCRIBER?SIGN IN

Reflects downloads up to 05 Mar 2025Bibliometrics
Abstract

No abstract available.

Skip Table Of Content Section
SESSION: Mobile Systems
research-article
Controlling physical memory fragmentation in mobile systems

Since the adoption of hardware-accelerated features (e.g., hardware codec) improves the performance and quality of mobile devices, it revives the need for contiguous memory allocation. However, physical memory in mobile systems is highly fragmented due ...

research-article
Don't race the memory bus: taming the GC leadfoot

Dynamic voltage and frequency scaling (DVFS) is ubiquitous on mobile devices as a mechanism for saving energy. Reducing the clock frequency of a processor allows a corresponding reduction in power consumption, as does turning off idle cores. Garbage ...

SESSION: New Memory Management Algorithms
research-article
Data structure aware garbage collector

Garbage collection may benefit greatly from knowledge about program behavior, but most managed languages do not provide means for the programmer to deliver such knowledge. In this work we propose a very simple interface that requires minor programmer ...

research-article
SuperMalloc: a super fast multithreaded malloc for 64-bit machines

SuperMalloc is an implementation of malloc(3) originally designed for X86 Hardware Transactional Memory (HTM)@. It turns out that the same design decisions also make it fast even without HTM@. For the malloc-test benchmark, which is one of the most ...

research-article
Concurrent compaction using a field pinning protocol

Compaction of memory in long running systems has always been important. The latency of compaction increases in today’s systems with high memory demands and large heaps. To deal with this problem, we present a lock-free protocol allowing for copying ...

SESSION: Managed Languages
research-article
Open Access
Stop and go: understanding yieldpoint behavior

Yieldpoints are critical to the implementation of high performance garbage collected languages, yet the design space is not well understood. Yieldpoints allow a running program to be interrupted at well-defined points in its execution, facilitating ...

research-article
Safe and efficient hybrid memory management for Java

Java uses automatic memory management, usually implemented as a garbage-collected heap. That lifts the burden of manually allocating and deallocating memory, but it can incur significant runtime overhead and increase the memory footprint of ...

research-article
A partial read barrier for efficient support of live object-oriented programming

Live programming, originally introduced by Smalltalk and Lisp, and now gaining popularity in contemporary systems such as Swift, requires on-the-fly support for object schema migration, such that the layout of objects may be changed while the program ...

research-article
Open Access
Memento mori: dynamic allocation-site-based optimizations

Languages that lack static typing are ubiquitous in the world of mobile and web applications. The rapid rise of larger applications like interactive web GUIs, games, and cryptography presents a new range of implementation challenges for modern virtual ...

SESSION: Optimizing Garbage Collection
research-article
Recycling trash in cache

The disparity between processing and storage speeds can be bridged in part by reducing the traffic into and out of the slower memory components. Some recent studies reduce such traffic by determining dead data in cache, showing that a significant ...

research-article
Reducing pause times with clustered collection

Each full garbage collection in a program with millions of objects can pause the program for multiple seconds. Much of this work is typically repeated, as the collector re-traces parts of the object graph that have not changed since the last ...

research-article
The judgment of forseti: economic utility for dynamic heap sizing of multiple runtimes

We introduce the FORSETI system, which is a principled approach for holistic memory management. It permits a sysadmin to specify the total physical memory resource that may be shared between all concurrent virtual machines on a physical node. FORSETI ...

Contributors
  • The Australian National University

Index Terms

  1. Proceedings of the 2015 International Symposium on Memory Management

    Recommendations

    Acceptance Rates

    Overall Acceptance Rate 72 of 156 submissions, 46%
    YearSubmittedAcceptedRate
    ISMM '14221150%
    ISMM '13221150%
    ISMM '09321547%
    ISMM '02411741%
    ISMM '00391846%
    Overall1567246%