Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
ParMarkSplit: A Parallel Mark-Split Garbage Collector Based on a Lock-Free Skip-List
Högskolan i Borås, Institutionen Handels- och IT-högskolan. (CSL@BS)
2014 (Engelska)Ingår i: / [ed] Marcos K. Aguilera, Marc Shapiro, Springer , 2014Konferensbidrag, Publicerat paper (Refereegranskat)
Abstract [en]

Mark-split is a garbage collection algorithm that combines advantages of both the mark-sweep and the copying collection algorithms. In this paper, we present a parallel mark-split garbage collector (GC). Our parallel design introduces and makes use of an efficient concurrency control mechanism for handling the list of free memory intervals. This mechanism is based on a lock-free skip-list design which supports an extended set of operations. Beside basic operations, it can perform a composite one that can search and remove and also insert two elements atomically. We have implemented the parallel mark-split GC in OpenJDK’s HotSpot virtual machine. We experimentally evaluate our collector and compare it with the default concurrent mark-sweep GC in HotSpot, using the DaCapo benchmarks, on two contemporary multiprocessor systems; one has 12 Intel Nehalem cores with HyperThreading and the other has 48 AMD Bulldozer cores. The evaluation shows that our parallel mark-split keeps the characteristics of the sequential mark-split, that it performs better than the concurrent mark-sweep in applications that have low live/garbage ratio, and have live objects locating contiguously, therefore being marked consecutively. Our parallel mark-split performs significantly better than a trivial parallelization based on locks in terms of both collection time and scalability.

Ort, förlag, år, upplaga, sidor
Springer , 2014.
Serie
Lecture Notes in Computer Science ; 8878
Nyckelord [en]
garbage collector, concurrent programming, mark-split, mark-sweep, parallel garbage collection, lock-free data structures, Parallel Computing
Nationell ämneskategori
Datavetenskap (datalogi)
Forskningsämne
Handel och IT
Identifikatorer
URN: urn:nbn:se:hb:diva-7256Lokalt ID: 2320/14719OAI: oai:DiVA.org:hb-7256DiVA, id: diva2:887967
Konferens
OPODIS 2014. The 18th International Conference on Principles of Distributed Systems, Cortina d'Ampezzo, Italy, 16-19 December, 2014
Tillgänglig från: 2015-12-22 Skapad: 2015-12-22 Senast uppdaterad: 2018-01-10Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Personposter BETA

Sundell, Håkan

Sök vidare i DiVA

Av författaren/redaktören
Sundell, Håkan
Av organisationen
Institutionen Handels- och IT-högskolan
Datavetenskap (datalogi)

Sök vidare utanför DiVA

GoogleGoogle Scholar

urn-nbn

Altmetricpoäng

urn-nbn
Totalt: 191 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf