Logo: to the web site of Uppsala University

uu.sePublications from Uppsala University
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • 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
Moving Garbage Collection with Low-Variation Memory Overhead and Deterministic Concurrent Relocation
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology.
2020 (English)Independent thesis Advanced level (professional degree), 20 credits / 30 HE creditsStudent thesis
Abstract [en]

A parallel and concurrent garbage collector offers low latency spikes. A common approach in such collectors is to move objects around in memory without stopping the application. This imposes additional overhead on an application in the form of tracking objects' movements, so that all pointers to them, can eventually be updated to the new locations. Typical ways of storing this information suffer from pathological cases where the size of this "forwarding information" can theoretically become as big as the heap itself. If we dimension the application for the pathological case this would be a waste of resources, since the memory usage is usually significantly less. This makes it hard to determine an application's memory requirements.

In this thesis, we propose a new design that trades memory for CPU, with a maximum memory overhead of less than 3.2% memory overhead. To evaluate the impact of this trade-off, measurements on application execution time was performed using the benchmarks from the DaCapo suite and SPECjbb2015. For 6 configurations in DaCapo a statistically significant negative effect on execution time in the range of 1-3% was found for the new design. For 10 configurations in DaCapo no change in execution times was shown in statistically significant data and two configurations in DaCapo showed a statistically significant shorter execution times for the new design on 6% and 22%, respectively. In SPECjbb2015, both max-jOPS and critical-jOPS has, for the new design, a statistically significant performance regression of ~2%. This suggests that for applications were stable and predictable memory footprint is important, this approach could be something to consider.

Place, publisher, year, edition, pages
2020. , p. 63
Series
UPTEC IT, ISSN 1401-5749 ; 20019
National Category
Computer and Information Sciences
Identifiers
URN: urn:nbn:se:uu:diva-414090OAI: oai:DiVA.org:uu-414090DiVA, id: diva2:1445578
External cooperation
Oracle
Educational program
Master of Science Programme in Information Technology Engineering
Supervisors
Examiners
Available from: 2020-06-24 Created: 2020-06-23 Last updated: 2020-06-24Bibliographically approved

Open Access in DiVA

Moving Garbage Collection with Low-Variation Memory Overhead and Deterministic Concurrent Relocation(4376 kB)11580 downloads
File information
File name FULLTEXT01.pdfFile size 4376 kBChecksum SHA-512
0d5df770b6ef455422db0f3b4642214e44bb358c0990988427293ceb1612f9e2cf109e2842fa48419ee8623ffd8454172413bf881f5b1bae403e2380bbec2fa1
Type fulltextMimetype application/pdf

By organisation
Department of Information Technology
Computer and Information Sciences

Search outside of DiVA

GoogleGoogle Scholar
Total: 11581 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: 1531 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • 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