![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
ISMM 2021: Virtual Event, Canada
- Zhenlin Wang, Tobias Wrigstad:
ISMM '21: 2021 ACM SIGPLAN International Symposium on Memory Management, Virtual Event, Canada, 22 June 2021. ACM 2021, ISBN 978-1-4503-8448-3 - Zixian Cai
, Stephen M. Blackburn
, Michael D. Bond
:
Understanding and utilizing hardware transactional memory capacity. 1-14 - Dong Chen, Chen Ding, Fangzhou Liu
, Benjamin Reber, Wesley Smith, Pengcheng Li:
Uniform lease vs. LRU cache: analysis and evaluation. 15-27 - Martin Maas
, Chris Kennelly
, Khanh Nguyen
, Darryl Gove, Kathryn S. McKinley, Paul Turner:
Adaptive huge-page subrelease for non-moving memory allocators in warehouse-scale computers. 28-38 - Guillaume Châtelet
, Chris Kennelly
, Sam (Likun) Xi, Ondrej Sýkora, Clement Courbet, Xinliang David Li, Bruno De Backer:
automemcpy: a framework for automatic generation of fundamental memory operations. 39-51 - Sam Ainsworth
, Timothy M. Jones
:
Compendia: reducing virtual-memory costs via selective densification. 52-65 - Sandeep Kumar, Aravinda Prasad, Smruti R. Sarangi, Sreenivas Subramoney:
Radiant: efficient page table management for tiered memory systems. 66-79 - Shoaib Akram:
Exploiting Intel optane persistent memory for full text search. 80-93 - Hiro Onozawa, Tomoharu Ugawa
, Hideya Iwasaki
:
Fusuma: double-ended threaded compaction. 94-106
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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.