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
Evaluating and improving remembered sets in theHotSpot G1 garbage collector
KTH, School of Computer Science and Communication (CSC).
2014 (English)Independent thesis Advanced level (degree of Master (Two Years)), 20 HE creditsStudent thesis
Abstract [en]

In this master’s thesis project the remembered set implementation in Java HotSpot’s implementation of G1 is evaluated. It is verified by benchmarking that using Bloomfilters can reduce region scanning times when used as an intermediate data structure between card-precision bitmaps and region coarsening. It is shown that iterating the Bloomfilter is made faster by combining binary trees with the Bloom filters. It is also verified that using a more narrowinteger type, with an added bitmap to keep track of null entries, will decrease the memory footprint caused by remembered sets. Both modifications to the current implementation cause application through put regressions in SPECjbb2013.

Abstract [sv]

Utvärdering och förbättringar av remembered sets i Javamaskinen HotSpots skräpsamlare G1I det här examensarbetet undersöks implementationen av remembered sets i HotSpots implementation av skräpsamlingsalgoritmen G1. Det bekräftas genom prestandamätningar att användandet av Bloomfilter kan minska tidsåtgångenför regionsavsökning. Detta när Bloomfiltret används som en mellanliggande datastruktur mellan bitmappar på kortnivå och bitmappar på regionsnivå. Det bekräftas också genom prestandamätningar att iterering över Bloomfilter kan snabbas upp genom att kombinera filtret med ett binärt sökträd. Vidare visas det att användandet av en heltalstyp med mindre räckvidd, tillsammans med införandet av en bitmapp för att registrera nullvärden, kan minska minnesanvändningen som remembered sets medför. I den standardiserade prestandamätningen SPECjbb2013 medför båda förändringarna dock prestandaförsämringar.

Place, publisher, year, edition, pages
2014.
National Category
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-153962OAI: oai:DiVA.org:kth-153962DiVA: diva2:754515
Examiners
Available from: 2014-11-20 Created: 2014-10-10 Last updated: 2014-11-20Bibliographically approved

Open Access in DiVA

fulltext(690 kB)290 downloads
File information
File name FULLTEXT01.pdfFile size 690 kBChecksum SHA-512
12cc9394a55c75970d20fe9f7b0a6b23739ddf8b169f14a536e9a62b81a671ad6f3b9840545dc4a0473ae003020f5b3558714d22a6e2e760dad873e0b8fac1db
Type fulltextMimetype application/pdf

By organisation
School of Computer Science and Communication (CSC)
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 290 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 114 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