6 citations · 13 across the 24 of their papers we have counts for
8 papers · 1 filter
Parallelism in Randomized Incremental Algorithms
Guy E. Blelloch, Yan Gu, Julian Shun +1
In this paper we show that many sequential randomized incremental algorithms are in fact parallel. We consider algorithms for several problems including Delaunay triangulation, lin…
Algorithmic Building Blocks for Asymmetric Memories
Yan Gu, Yihan Sun, Guy E. Blelloch
The future of main memory appears to lie in the direction of new non-volatile memory technologies that provide strong capacity-to-performance ratios, but have write operations that…
The Parallel Persistent Memory Model
Guy E. Blelloch, Phillip B. Gibbons, Yan Gu +2
We consider a parallel computational model that consists of processors, each with a fast local ephemeral memory of limited size, and sharing a large persistent memory. The mode…
Delay-Free Concurrency on Faulty Persistent Memory
Naama Ben-David, Guy E. Blelloch, Michal Friedman +1
Non-volatile memory (NVM) promises persistent main memory that remains correct despite loss of power. This has sparked a line of research into algorithms that can recover from a sy…
Parallel Write-Efficient Algorithms and Data Structures for Computational Geometry
Guy E. Blelloch, Yan Gu, Yihan Sun +1
In this paper, we design parallel write-efficient geometric algorithms that perform asymptotically fewer writes than standard algorithms for the same problem. This is motivated by…
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable
Laxman Dhulipala, Guy E. Blelloch, Julian Shun
There has been significant recent interest in parallel graph processing due to the need to quickly analyze the large graphs available today. Many graph codes have been designed for…