FliT: a library for simple and efficient persistent algorithms | 0 | 0.34 | 2022 |
Brief Announcement: Classifying Trusted Hardware via Unidirectional Communication | 0 | 0.34 | 2021 |
Space and Time Bounded Multiversion Garbage Collection. | 0 | 0.34 | 2021 |
Constant-time snapshots with applications to concurrent data structures | 0 | 0.34 | 2021 |
Unfair Scheduling Patterns in NUMA Architectures | 0 | 0.34 | 2019 |
Delay-Free Concurrency on Faulty Persistent Memory. | 0 | 0.34 | 2019 |
Multiversion Concurrency with Bounded Delay and Precise Garbage Collection | 0 | 0.34 | 2019 |
Making concurrent algorithms detectable - poster. | 0 | 0.34 | 2019 |
The Impact of RDMA on Agreement. | 0 | 0.34 | 2019 |
Making Concurrent Algorithms Detectable. | 0 | 0.34 | 2018 |
Implicit Decomposition for Write-Efficient Connectivity Algorithms | 4 | 0.38 | 2018 |
Passing Messages while Sharing Memory. | 0 | 0.34 | 2018 |
Efficient Single Writer Concurrency. | 1 | 0.37 | 2018 |
Contention in Structured Concurrency: Provably Efficient Dynamic Non-Zero Indicators for Nested Parallelism. | 0 | 0.34 | 2017 |
Analyzing Contention and Backoff in Asynchronous Shared Memory. | 1 | 0.36 | 2017 |
Parallel Algorithms for Asymmetric Read-Write Costs. | 9 | 0.51 | 2016 |
k-Abortable Objects: Progress Under High Contention. | 0 | 0.34 | 2016 |