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.
Identifer | oai:union.ndltd.org:UPSALLA1/oai:DiVA.org:lnu-20507 |
Date | January 2012 |
Creators | Österlund, Erik |
Publisher | Linnéuniversitetet, Institutionen för datavetenskap, fysik och matematik, DFM |
Source Sets | DiVA Archive at Upsalla University |
Language | English |
Detected Language | English |
Type | Student thesis, info:eu-repo/semantics/bachelorThesis, text |
Format | application/pdf |
Rights | info:eu-repo/semantics/openAccess |
Relation | Rapporter från MSI, 1650-2647 |
Page generated in 0.0017 seconds