activity
20102023
most citedTheoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable

97 citations · 438 across the 36 of their papers we have counts for

collaborators
Showing 2018Show all

6 papers · 1 filter

cs.DB2018★ 29 cited

Chiller: Contention-centric Transaction Execution and Data Partitioning for Modern Networks

Erfan Zamanian, Julian Shun, Carsten Binnig +1

Distributed transactions on high-overhead TCP/IP-based networks were conventionally considered to be prohibitively expensive and thus were avoided at all costs. To that end, the pr…

cs.DS2018

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…

cs.DC2018★ 14 cited

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…

cs.DS2018★ 14 cited

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…

cs.DS2018★ 97 cited

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…

cs.PL2018★ 10 cited

GraphIt: A High-Performance DSL for Graph Analytics

Yunming Zhang, Mengjiao Yang, Riyadh Baghdadi +3

The performance bottlenecks of graph applications depend not only on the algorithm and the underlying hardware, but also on the size and structure of the input graph. Programmers m…