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
Concurrent Compaction using a Field Pinning Protocol
Linnaeus University, Faculty of Technology, Department of Computer Science.
Linnaeus University, Faculty of Technology, Department of Computer Science.ORCID iD: 0000-0002-7565-3714
2015 (English)In: ISMM 2015 Proceedings of the 2015 ACM SIGPLAN International Symposium on Memory Management, ACM Press, 2015, Vol. 50(11), p. 56-69Conference paper, Published paper (Refereed)
Abstract [en]

Compaction of memory in long running systems has always been important. The latency of compaction increases in today’s systems with high memory demands and large heaps. To deal with this problem, we present a lock-free protocol allowing for copying concurrent with the application running, which reduces the latencies of compaction radically. It pro- vides theoretical progress guarantees for copying and appli- cation threads without making it practically infeasible, with performance overheads of 20% on average. The algorithm paves way for a future lock-free Garbage Collector. 

Place, publisher, year, edition, pages
ACM Press, 2015. Vol. 50(11), p. 56-69
Series
SIGPLAN notices, ISSN 0362-1340 ; 50(11)
National Category
Computer Sciences
Research subject
Computer and Information Sciences Computer Science, Computer Science
Identifiers
URN: urn:nbn:se:lnu:diva-42434DOI: 10.1145/2754169.2754177ISI: 000370548500006Scopus ID: 2-s2.0-84959917293ISBN: 978-1-4503-3589-8 (print)OAI: oai:DiVA.org:lnu-42434DiVA, id: diva2:805584
Conference
ACM SIGPLAN International Symposium on Memory Management, ISMM, 14 Jun., 2015, Portland
Funder
Swedish Research Council, 2011-6185Available from: 2015-04-15 Created: 2015-04-15 Last updated: 2018-01-11Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records BETA

Österlund, ErikLöwe, Welf

Search in DiVA

By author/editor
Österlund, ErikLöwe, Welf
By organisation
Department of Computer Science
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 122 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