Obserwuj
Haosen Wen
Haosen Wen
Nieznane powiązanie
Brak zweryfikowanego adresu e-mail - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
Interval-based memory reclamation
H Wen, J Izraelevitz, W Cai, HA Beadle, ML Scott
ACM SIGPLAN Notices 53 (1), 1-13, 2018
692018
Understanding and optimizing persistent memory allocation
W Cai, H Wen, HA Beadle, C Kjellqvist, M Hedayati, ML Scott
Proceedings of the 2020 ACM SIGPLAN International Symposium on Memory …, 2020
512020
Nonblocking persistent software transactional memory
HA Beadle, W Cai, H Wen, ML Scott
Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of …, 2020
162020
A fast, general system for buffered persistent data structures
H Wen, W Cai, M Du, L Jenkins, B Valpey, ML Scott
Proceedings of the 50th International Conference on Parallel Processing, 1-11, 2021
132021
Fast Nonblocking Persistence for Concurrent Data Structures
W Cai, H Wen, V Maksimovski, M Du, R Sanna, S Abdallah, ML Scott
arXiv preprint arXiv:2105.09508, 2021
72021
Montage: A general system for buffered durably linearizable data structures
H Wen, W Cai, M Du, L Jenkins, B Valpey, ML Scott
arXiv preprint arXiv:2009.13701, 2020
42020
Brief Announcement: Building Fast Recoverable Persistent Data Structures with Montage
H Wen, W Cai, M Du, B Valpey, ML Scott
34th International Symposium on Distributed Computing (DISC 2020), 2020
12020
Towards Efficient Nonblocking Persistent Software Transactional Memory
HA Beadle, W Cai, H Wen, M Scott
12019
Transactional Composition of Nonblocking Data Structures
W Cai, H Wen, ML Scott
Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and …, 2023
2023
Memory Management and Persistency of Multithreaded Applications
H Wen
University of Rochester, 2022
2022
Building Fast Recoverable Persistent Data Structures with Montage
H Wen, W Cai, M Du, B Valpey, ML Scott
Leibniz international proceedings in informatics, 2020
2020
Building Fast Recoverable Persistent Data Structures
H Wen, W Cai, M Du, L Jenkins, B Valpey, ML Scott
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–12