default search action
ISMM 2016: Santa Barbara, CA, USA
- Christine H. Flood, Eddy Zheng Zhang:
Proceedings of the 2016 ACM SIGPLAN International Symposium on Memory Management, Santa Barbara, CA, USA, June 14 - 14, 2016. ACM 2016, ISBN 978-1-4503-4317-6
Concurrent Memory Management
- Erik Österlund, Welf Löwe:
Block-free concurrent GC: stack scanning and copying. 1-12 - Du Shen, Xu Liu, Felix Xiaozhu Lin:
Characterizing emerging heterogeneous memory. 13-23 - Raj Parihar, Jacob Brock, Chen Ding, Michael C. Huang:
Hardware support for protective and collaborative cache sharing. 24-35 - Dave Dice, Maurice Herlihy, Alex Kogan:
Fast non-intrusive memory reclamation for highly-concurrent data structures. 36-45
Non-traditional and Datacenter Scale Memory System
- Wessam Hassanein:
Understanding and improving JVM GC work stealing at the data center scale. 46-54 - Hans-Juergen Boehm, Dhruva R. Chakrabarti:
Persistence programming models for non-volatile memory. 55-67 - Yuxin Ren, Gabriel Parmer, Teo Georgiev, Gedare Bloom:
CBufs: efficient, system-wide memory management and sharing. 68-77 - François Gindraud, Fabrice Rastello, Albert Cohen, François Broquedis:
A bounded memory allocator for software-defined global address spaces. 78-88
Modeling, Characterization, and Tools
- Yi Lin, Stephen M. Blackburn, Antony L. Hosking, Michael Norrish:
Rust as a language for high performance GC implementation. 89-98 - Man Cao, Jake Roemer, Aritra Sengupta, Michael D. Bond:
Prescient memory: exposing weak memory model behavior by looking into the future. 99-110 - Pengcheng Li, Hao Luo, Chen Ding:
Rethinking a heap hierarchy as a cache hierarchy: a higher-order theory of memory demand (HOTM). 111-121 - Prasanna Kumar K., Amitabha Sanyal, Amey Karkare:
Liveness-based garbage collection for lazy languages. 122-133
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.