Hierarchical real-time garbage collection

Filip Pizlo*, Antony L. Hosking, Jan Vitek

*Corresponding author for this work

Research output: Contribution to conferencePaperpeer-review

17 Citations (Scopus)

Abstract

Memory management is a critical issue for correctness and performance in real-time embedded systems. Recent work on real-time garbage collectors has shown that it is possible to provide guarantees on worst-case pause times and minimum mutator utilization time. This paper presents a new hierarchical real-time garbage collection algorithm for mixed-priority and mixed-criticality environments. With hierarchical garbage collection, real-time programmers can partition the heap into a number of heaplets and for each partition choose to run a separate collector with a schedule that matches the allocation behavior and footprint of the real-time task using it. This approach lowers worst-case response times of real-time applications by 26%, while almost doubling mutator utilization - all with only minimal changes to the application code.

Original languageEnglish
Pages123-133
Number of pages11
DOIs
Publication statusPublished - 2007
Externally publishedYes
EventLCTES'07: 2007 ACM SIGPLAN-SIGBED Conference on Languages, Compilers, and Tools for Embedded Systems - San Diego, CA, United States
Duration: 13 Jun 200715 Jun 2007

Conference

ConferenceLCTES'07: 2007 ACM SIGPLAN-SIGBED Conference on Languages, Compilers, and Tools for Embedded Systems
Country/TerritoryUnited States
CitySan Diego, CA
Period13/06/0715/06/07

Fingerprint

Dive into the research topics of 'Hierarchical real-time garbage collection'. Together they form a unique fingerprint.

Cite this