lnu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Block-free concurrent GC: Stack scanning and copying
Linnaeus University, Faculty of Technology, Department of Computer Science.
Linnaeus University, Faculty of Technology, Department of Computer Science.ORCID iD: 0000-0002-7565-3714
2016 (English)In: ISMM 2016: Proceedings of the 2016 ACM SIGPLAN International Symposium on Memory Management, ACM Press, 2016, 1-12 p.Conference paper, Published paper (Refereed)
Abstract [en]

On-the-fly Garbage Collectors (GCs) are the state-of-the-art concurrent GC algorithms today. Everything is done concurrently, but phases are separated by blocking handshakes. Hence, progress relies on the scheduler to let application threads (mutators) run into GC checkpoints to reply to the handshakes. For a non-blocking GC, these blocking handshakes need to be addressed. Therefore, we propose a new non-blocking handshake to replace previous blocking handshakes. It guarantees schedulingindependent operation level progress without blocking. It is scheduling independent but requires some other OS support. It allows bounded waiting for threads that are currently running on a processor, regardless of threads that are not running on a processor. We discuss this non-blocking handshake in two GC algorithms for stack scanning and copying objects. They pave way for a future completely non-blocking GC by solving hard open theory problems when OS support is permitted. The GC algorithms were integrated to the G1 GC of OpenJDK for Java. GC pause times were reduced to 12.5% compared to the original G1 on average in DaCapo. For a memory intense benchmark, latencies were reduced from 174 ms to 0.67 ms for the 99.99% percentile. The improved latency comes at a cost of 15% lower throughput.

Place, publisher, year, edition, pages
ACM Press, 2016. 1-12 p.
Keyword [en]
Block-free, Compaction, Garbage collection, Non-blocking, Stack scanning
National Category
Computer Systems
Research subject
Computer and Information Sciences Computer Science
Identifiers
URN: urn:nbn:se:lnu:diva-56115DOI: 10.1145/2926697.2926701Scopus ID: 2-s2.0-84978488416ISBN: 9781450343176 (print)OAI: oai:DiVA.org:lnu-56115DiVA: diva2:965954
Conference
15th ACM SIGPLAN International Symposium on Memory Management, ISMM 2016, 14 June 2016
Available from: 2016-09-08 Created: 2016-08-31 Last updated: 2017-04-24Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Österlund, ErikLöwe, Welf
By organisation
Department of Computer Science
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 80 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf