69 citations · 180 across the 26 of their papers we have counts for
5 papers · 1 filter
PIM-tree: A Skew-resistant Index for Processing-in-Memory
Hongbo Kang, Yiwei Zhao, Guy E. Blelloch +4
The performance of today's in-memory indexes is bottlenecked by the memory latency/bandwidth wall. Processing-in-memory (PIM) is an emerging approach that potentially mitigates thi…
Parallel Longest Increasing Subsequence and van Emde Boas Trees
Yan Gu, Ziyang Men, Zheqi Shen +2
This paper studies parallel algorithms for the longest increasing subsequence (LIS) problem. Let be the input size and be the LIS length of the input. Sequentially, LIS is…
ParGeo: A Library for Parallel Computational Geometry
Yiqiu Wang, Rahul Yesantharao, Shangdi Yu +3
This paper presents ParGeo, a multicore library for computational geometry. ParGeo contains modules for fundamental tasks including d-tree based spatial search, spatial graph ge…
Many Sequential Iterative Algorithms Can Be Parallel and (Nearly) Work-efficient
Zheqi Shen, Zijin Wan, Yan Gu +1
To design efficient parallel algorithms, some recent papers showed that many sequential iterative algorithms can be directly parallelized but there are still challenges in achievin…
PaC-trees: Supporting Parallel and Compressed Purely-Functional Collections
Laxman Dhulipala, Guy E. Blelloch, Yan Gu +1
Many modern programming languages are shifting toward a functional style for collection interfaces such as sets, maps, and sequences. Functional interfaces offer many advantages, i…