6 citations · 18 across the 26 of their papers we have counts for
Showing 2019 · cs.DCShow all
3 papers · 2 filters
cs.DC2019
LL/SC and Atomic Copy: Constant Time, Space Efficient Implementations using only pointer-width CAS
Guy E. Blelloch, Yuanhao Wei
When designing concurrent algorithms, Load-Link/Store-Conditional (LL/SC) is often the ideal primitive to have because unlike Compare and Swap (CAS), LL/SC is immune to the ABA pro…
cs.DC2019
Sage: Parallel Semi-Asymmetric Graph Algorithms for NVRAMs
Laxman Dhulipala, Charlie McGuffey, Hongbo Kang +4
Non-volatile main memory (NVRAM) technologies provide an attractive set of features for large-scale graph analytics, including byte-addressability, low idle power, and improved mem…
cs.DC2019
Low-Latency Graph Streaming Using Compressed Purely-Functional Trees
Laxman Dhulipala, Julian Shun, Guy Blelloch
Due to the dynamic nature of real-world graphs, there has been a growing interest in the graph-streaming setting where a continuous stream of graph updates is mixed with arbitrary…