Parallel Write-Efficient Algorithms and Data Structures for Computational Geometry
© 2018 Association for Computing Machinery. 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 emerging non-volatile memory technologies with read performance being close...
Main Authors: | Blelloch, Guy E, Gu, Yan, Shun, Julian, Sun, Yihan |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | English |
Published: |
Association for Computing Machinery (ACM)
2021
|
Online Access: | https://hdl.handle.net/1721.1/135029 |
Similar Items
-
Parallelism in Randomized Incremental Algorithms
by: Blelloch, Guy, et al.
Published: (2022) -
Randomized Incremental Convex Hull is Highly Parallel
by: Blelloch, Guy, et al.
Published: (2022) -
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable
by: Dhulipala, Laxman, et al.
Published: (2022) -
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable
by: Dhulipala, Laxman, et al.
Published: (2021) -
Implicit Decomposition for Write-Efficient Connectivity Algorithms
by: Ben-David, Naama, et al.
Published: (2021)