Change search
ReferencesLink to record
Permanent link

Direct link
Automatic memory management system for automatic parallelization
Linnaeus University, Faculty of Science and Engineering, School of Computer Science, Physics and Mathematics.
2011 (English)Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
Abstract [en]

With Moore’s law coming to an end and the era of multiprocessor chips emerging, the need for ways of dealing with the essential problems with concurrency is becoming imminent. Automatic parallelization for imperative languages and pure functions in functional programming languages all try to prove independence statically. This thesis argues that independence is dynamic in nature. Static analysis for automatic parallelization has failed to do anything but trivial optimizations.

This thesis shows a new approach where dynamic analysis about the system is provided for very low costs using a garbage collector that has to go through all live cells anyway. Immutable sub-graphs of objects that cannot change state are found. Their methods become pure functions that can be parallelized. The garbage collector implemented is a kind of replicating collector. It is about three times faster than Boehm’s collector in garbage collection, fully concurrent and provides the dynamic analysis almost for free.

Place, publisher, year, edition, pages
2011. , 37 p.
National Category
Computer Science
URN: urn:nbn:se:lnu:diva-13693OAI: diva2:433707
Subject / course
Computer Science
Educational program
Software Technology Programme, 180 credits
Available from: 2011-08-15 Created: 2011-08-11 Last updated: 2011-08-15Bibliographically approved

Open Access in DiVA

eosst08_bachelor_thesis(1364 kB)511 downloads
File information
File name FULLTEXT01.pdfFile size 1364 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Search in DiVA

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

Search outside of DiVA

GoogleGoogle Scholar
Total: 511 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

Total: 633 hits
ReferencesLink to record
Permanent link

Direct link