Garbage Collection supporting automatic JIT parallelization in JVM
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 wr...
Main Author: | |
---|---|
Format: | Others |
Language: | English |
Published: |
Linnéuniversitetet, Institutionen för datavetenskap, fysik och matematik, DFM
2012
|
Subjects: | |
Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-20507 |
id |
ndltd-UPSALLA1-oai-DiVA.org-lnu-20507 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-UPSALLA1-oai-DiVA.org-lnu-205072018-01-13T05:16:12ZGarbage Collection supporting automatic JIT parallelization in JVMengÖsterlund, ErikLinnéuniversitetet, Institutionen för datavetenskap, fysik och matematik, DFM2012garbage collectiondynamic analysisautomatic parallelizationEngineering and TechnologyTeknik och teknologierComputer SciencesDatavetenskap (datalogi)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. Student thesisinfo:eu-repo/semantics/bachelorThesistexthttp://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-20507Rapporter från MSI, 1650-2647application/pdfinfo:eu-repo/semantics/openAccess |
collection |
NDLTD |
language |
English |
format |
Others
|
sources |
NDLTD |
topic |
garbage collection dynamic analysis automatic parallelization Engineering and Technology Teknik och teknologier Computer Sciences Datavetenskap (datalogi) |
spellingShingle |
garbage collection dynamic analysis automatic parallelization Engineering and Technology Teknik och teknologier Computer Sciences Datavetenskap (datalogi) Österlund, Erik Garbage Collection supporting automatic JIT parallelization in JVM |
description |
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. |
author |
Österlund, Erik |
author_facet |
Österlund, Erik |
author_sort |
Österlund, Erik |
title |
Garbage Collection supporting automatic JIT parallelization in JVM |
title_short |
Garbage Collection supporting automatic JIT parallelization in JVM |
title_full |
Garbage Collection supporting automatic JIT parallelization in JVM |
title_fullStr |
Garbage Collection supporting automatic JIT parallelization in JVM |
title_full_unstemmed |
Garbage Collection supporting automatic JIT parallelization in JVM |
title_sort |
garbage collection supporting automatic jit parallelization in jvm |
publisher |
Linnéuniversitetet, Institutionen för datavetenskap, fysik och matematik, DFM |
publishDate |
2012 |
url |
http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-20507 |
work_keys_str_mv |
AT osterlunderik garbagecollectionsupportingautomaticjitparallelizationinjvm |
_version_ |
1718608990739365888 |