lnu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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
Analysis of pure methods using garbage collection
Linnaeus University, Faculty of Science and Engineering, School of Computer Science, Physics and Mathematics.
Linnaeus University, Faculty of Science and Engineering, School of Computer Science, Physics and Mathematics.ORCID iD: 0000-0002-7565-3714
2012 (English)In: Proceedings of the 2012 ACM SIGPLAN Workshop on Memory Systems Performance and Correctness, ACM Press, 2012, 48-57 p.Conference paper, Published paper (Refereed)
Abstract [en]

Parallelization and other optimizations often depend on static dependence analysis. This approach requires methods to be independent regardless of the input data, which is not always the case.

Our contribution is a dynamic analysis "guessing" if methods are pure, i. e., if they do not change state. The analysis is piggybacking on a garbage collector, more specifically, a concurrent, replicating garbage collector. It guesses whether objects are immutable by looking at actual mutations observed by the garbage collector. The analysis is essentially for free. In fact, our concurrent garbage collector including analysis outperforms Boehm's stop-the-world collector (without any analysis), as we show in experiments. Moreover, false guesses can be rolled back efficiently.

The results can be used for just-in-time parallelization allowing an automatic parallelization of methods that are pure over certain periods of time. Hence, compared to parallelization based on static dependence analysis, more programs potentially benefit from parallelization.

Place, publisher, year, edition, pages
ACM Press, 2012. 48-57 p.
Keyword [en]
garbage collection, automatic parallelization, dynamic analysis, pure functions
National Category
Computer Science
Research subject
Computer Science, Software Technology
Identifiers
URN: urn:nbn:se:lnu:diva-25976DOI: 10.1145/2247684.2247694Scopus ID: 2-s2.0-84863436374ISBN: 978-1-4503-1219-6 (print)OAI: oai:DiVA.org:lnu-25976DiVA: diva2:624369
Conference
ACM SIGPLAN Workshop on Memory Systems Performance and Correctness
Funder
Swedish Research Council, 2011-6185
Available from: 2013-05-31 Created: 2013-05-31 Last updated: 2017-01-27Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopusACM Auther-Izer

Authority records BETA

Österlund, ErikLöwe, Welf

Search in DiVA

By author/editor
Österlund, ErikLöwe, Welf
By organisation
School of Computer Science, Physics and Mathematics
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 121 hits
CiteExportLink to record
Permanent link

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