Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • 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
Garbage Collection supporting automatic JIT parallelization in JVM
Linnaeus University, Faculty of Science and Engineering, School of Computer Science, Physics and Mathematics.
2012 (English)Independent thesis Advanced level (degree of Master (One Year)), 10 credits / 15 HE creditsStudent thesis
Abstract [en]

With increasing clock-rates in CPUs coming to an end, a need for parallelization has emerged. This thesis proposes a dynamic purity analysis of objects, detecting independent execution paths that may be run in parallel. The analysis relies in speculative guesses and may be rolled back when proven wrong. It piggybags on an efficient replicating garbage collector integrated to JVM.

The efficiency of the algorithms are shown in benchmark, and are comparable to the speed of state of the art garbage collectors in hotspot’s JVM.

With this dynamic purity analysis now accessible in Java programs, the potential for automatic JIT-parallelization of pure methods is possible.

Place, publisher, year, edition, pages
2012. , 29 p.
Series
Reports from MSI, ISSN 1650-2647
Keyword [en]
garbage collection, dynamic analysis, automatic parallelization
National Category
Engineering and Technology Computer Science
Identifiers
URN: urn:nbn:se:lnu:diva-20507OAI: oai:DiVA.org:lnu-20507DiVA: diva2:537556
Subject / course
Computer Science
Educational program
Software Technology Programme, Master Programme, 60 credits
Presentation
2012-05-31, 22:42 (English)
Uppsok
Technology
Supervisors
Examiners
Available from: 2012-06-27 Created: 2012-06-26 Last updated: 2012-06-27Bibliographically approved

Open Access in DiVA

thesis(851 kB)2945 downloads
File information
File name FULLTEXT01.pdfFile size 851 kBChecksum SHA-512
064bbc3979c195c019958983b79c38afcf6044dd1a9769e511388da12d82c5551a746a8383adafb9e1e8f49b1b6030c03f89af462d5b5078e8de4d874251c470
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Österlund, Erik
By organisation
School of Computer Science, Physics and Mathematics
Engineering and TechnologyComputer Science

Search outside of DiVA

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

Direct link
Cite
Citation style
  • apa
  • 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