Erik Österlund

Orcid: 0000-0003-3686-8568

According to our database1, Erik Österlund authored at least 12 papers between 2012 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Scheduling Garbage Collection for Energy Efficiency on Asymmetric Multicore Processors.
Art Sci. Eng. Program., 2024

Mark-Scavenge: Waiting for Trash to Take Itself Out.
Proc. ACM Program. Lang., 2024

2023
Heap Size Adjustment with CPU Control.
Proceedings of the 20th ACM SIGPLAN International Conference on Managed Programming Languages and Runtimes, 2023

2022
Compressed Forwarding Tables Reconsidered.
Proceedings of the 19th International Conference on Managed Programming Languages and Runtimes, 2022

2020
Improving program locality in the GC using hotness.
Proceedings of the 41st ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2020

ThinGC: complete isolation with marginal overhead.
Proceedings of the ISMM '20: 2020 ACM SIGPLAN International Symposium on Memory Management, 2020

2018
Self-adaptive concurrent components.
Autom. Softw. Eng., 2018

2016
Block-free concurrent GC: stack scanning and copying.
Proceedings of the 2016 ACM SIGPLAN International Symposium on Memory Management, Santa Barbara, CA, USA, June 14, 2016

2015
Concurrent compaction using a field pinning protocol.
Proceedings of the 2015 ACM SIGPLAN International Symposium on Memory Management, 2015

2014
Concurrent transformation components using contention context sensors.
Proceedings of the ACM/IEEE International Conference on Automated Software Engineering, 2014

2013
Dynamically transforming data structures.
Proceedings of the 2013 28th IEEE/ACM International Conference on Automated Software Engineering, 2013

2012
Analysis of pure methods using garbage collection.
Proceedings of the 2012 ACM SIGPLAN workshop on Memory Systems Performance and Correctness: held in conjunction with PLDI '12, 2012


  Loading...