6 citations · 13 across the 24 of their papers we have counts for
5 papers · 1 filter
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…
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…
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…
Parallel Batch-Dynamic Graph Connectivity
Umut A. Acar, Daniel Anderson, Guy E. Blelloch +1
In this paper, we study batch parallel algorithms for the dynamic connectivity problem, a fundamental problem that has received considerable attention in the sequential setting. Th…
Optimal (Randomized) Parallel Algorithms in the Binary-Forking Model
Guy E. Blelloch, Jeremy T. Fineman, Yan Gu +1
In this paper we develop optimal algorithms in the binary-forking model for a variety of fundamental problems, including sorting, semisorting, list ranking, tree contraction, range…