Affiliation:
1. Carnegie Mellon University, Pittsburgh, PA
2. University of California, Riverside, CA
3. MIT CSAIL, Cambridge, MA
Abstract
In this article, we show that many sequential randomized incremental algorithms are in fact parallel. We consider algorithms for several problems, including Delaunay triangulation, linear programming, closest pair, smallest enclosing disk, least-element lists, and strongly connected components.
We analyze the dependencies between iterations in an algorithm and show that the dependence structure is shallow with high probability or that, by violating some dependencies, the structure is shallow and the work is not increased significantly. We identify three types of algorithms based on their dependencies and present a framework for analyzing each type. Using the framework gives work-efficient polylogarithmic-depth parallel algorithms for most of the problems that we study.
This article shows the first incremental Delaunay triangulation algorithm with optimal work and polylogarithmic depth. This result is important, since most implementations of parallel Delaunay triangulation use the incremental approach. Our results also improve bounds on strongly connected components and least-element lists and significantly simplify parallel algorithms for several problems.
Funder
NSF
Miller Institute for Basic Research in Science at UC Berkeley
Intel Science and Technology Center for Cloud Computing
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Multi-agreements in social networks based on LaSalle invariance principle and positive definiteness;Automatica;2024-07
2. Parallel and (Nearly) Work-Efficient Dynamic Programming;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17
3. Work-Efficient Parallel Derandomization II: Optimal Concentrations via Bootstrapping;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
4. Teaching Parallel Algorithms Using the Binary-Forking Model;2024 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW);2024-05-27
5. Parallel Integer Sort: Theory and Practice;Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming;2024-02-20