Logo: to the web site of Uppsala University

uu.sePublikasjoner fra Uppsala universitet
Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Compressing Pointers for the Z Garbage Collector: Runtime compression of pointers in a concurrent setting
Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
2023 (engelsk)Independent thesis Advanced level (professional degree), 20 poäng / 30 hpOppgave
Abstract [en]

Pointers in 64-bit architectures are unlikely to exhaust their vast address range, and are as such needlessly big. Reducing the amount of memory a pointer occupies leads to reduced memory demands, better usage of memory, and better locality. Pointer compression is a term that encompasses techniques that aim to make pointers occupy less memory, often to 32-bit for the sake of word alignment. Pointers that are 32-bit embody the opposite problem of having too restricted of an address range, being able to address only 4 GB. Z is a garbage collector in the HotSpot JVM which does not support pointer compression. Partly because the aforementioned address range restriction, and partly because the implementation of compressed pointers which exist in HotSpot would clash with the goals of the garbage collector. This project explores ways of implementing pointer compression for Z that isn't detrimental to the goals of the garbage collector, and aims to find where problems may occur. The outset was to explore compressing speculatively during runtime. The result is a design that relies on a custom bit layout for compressed pointers, inspecting bit layouts of the pointers on each read and write to detect the compression status. This seems to be the most promising in terms of code maintainability and ease of implementation. 

sted, utgiver, år, opplag, sider
2023. , s. 30
Serie
UPTEC IT, ISSN 1401-5749 ; 23011
Emneord [en]
garbage collector, concurrent garbage collector, ZGC, pointer compression, hotspot
HSV kategori
Identifikatorer
URN: urn:nbn:se:uu:diva-503840OAI: oai:DiVA.org:uu-503840DiVA, id: diva2:1766097
Eksternt samarbeid
Oracle
Fag / kurs
Computer Systems Sciences
Utdanningsprogram
Master of Science Programme in Information Technology Engineering
Veileder
Examiner
Tilgjengelig fra: 2023-06-13 Laget: 2023-06-12 Sist oppdatert: 2023-06-13bibliografisk kontrollert

Open Access i DiVA

fulltext(772 kB)303 nedlastinger
Filinformasjon
Fil FULLTEXT01.pdfFilstørrelse 772 kBChecksum SHA-512
5daedb5a81806414e4eb4788dea73601b14ad644afd633c4938b052c5a3483b85f24294f9182454b759527f83d6c2e1fa84ecc151b245a8fae00e9b72a642201
Type fulltextMimetype application/pdf

Søk i DiVA

Av forfatter/redaktør
Shoravi, Linus
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar
Totalt: 303 nedlastinger
Antall nedlastinger er summen av alle nedlastinger av alle fulltekster. Det kan for eksempel være tidligere versjoner som er ikke lenger tilgjengelige

urn-nbn

Altmetric

urn-nbn
Totalt: 730 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf