STOPLESS: A real-time garbage collector for multiprocessors

Filip Pizlo, Daniel Frampton, Erez Petrank, Bjarne Steensgaard

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    77 Citations (Scopus)

    Abstract

    We present STOPLESS: a concurrent real-time garbage collector suitable for modern multiprocessors running parallel multithreaded applications. Creating a garbage-collected environment that supports real-time on modern platforms is notoriously hard, especially if real-time implies lock-freedom. Known real-time collectors either restrict the real-time guarantees to uniprocessors only, rely on special hardware, or just give up supporting atomic operations (which are crucial for lock-free software). STOPLESS is the first collector that provides real-time responsiveness while preserving lock-freedom, supporting atomic operations, controlling fragmentation by compaction, and supporting modern parallel platforms. STOPLESS is adequate for modern languages such as C# or Java. It was implemented on top of the Bartok compiler and runtime for C# and measurements demonstrate high responsiveness (a factor of a 100 better than previously published systems), virtually no pause times, good mutator utilization, and acceptable overheads.

    Original languageEnglish
    Title of host publicationISMM'07
    Subtitle of host publicationProceedings of the 2007 International Symposium on Memory Management
    Pages159-172
    Number of pages14
    DOIs
    Publication statusPublished - 2007
    EventISMM'07: 2007 International Symposium on Memory Management - Montreal, QC, Canada
    Duration: 21 Oct 200722 Oct 2007

    Publication series

    NameInternational Symposium on Memory Management, ISMM

    Conference

    ConferenceISMM'07: 2007 International Symposium on Memory Management
    Country/TerritoryCanada
    CityMontreal, QC
    Period21/10/0722/10/07

    Fingerprint

    Dive into the research topics of 'STOPLESS: A real-time garbage collector for multiprocessors'. Together they form a unique fingerprint.

    Cite this