Many Sequential Iterative Algorithms Can Be Parallel and (Nearly) Work-efficient-Reference-Cited by-同舟云学术

Many Sequential Iterative Algorithms Can Be Parallel and (Nearly) Work-efficient

Published:2022-07-11 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures
language:
Short-container-title:

Author:

Shen Zheqi¹,Wan Zijin¹,Gu Yan¹,Sun Yihan¹

Affiliation:

1. UC Riverside, Riverside, CA, USA

Funder

National Science Foundation

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3490148.3538574

Reference70 articles.

1. Openstreetmap © openstreetmap contributors. https://www.openstreetmap.org/ , 2010 . Openstreetmap © openstreetmap contributors. https://www.openstreetmap.org/, 2010.

2. U. A. Acar , G. E. Blelloch , and R. D. Blumofe . The data locality of work stealing. Theoretical Computer Science (TCS), 35(3) , 2002 . U. A. Acar, G. E. Blelloch, and R. D. Blumofe. The data locality of work stealing. Theoretical Computer Science (TCS), 35(3), 2002.

3. Beeping a maximal independent set

4. Provably good scheduling for parallel programs that use data structures through implicit batching

5. A divide and conquer approach and a work-optimal parallel algorithm for the LIS problem

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Analysis and Construction of Hardware Accelerators for Calculating the Shortest Path in Real-Time Robot Route Planning;Electronics;2024-06-02

2. Fast and Space-Efficient Parallel Algorithms for Influence Maximization;Proceedings of the VLDB Endowment;2023-11

3. Nearly Optimal Parallel Algorithms for Longest Increasing Subsequence;Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures;2023-06-17

4. Parallel Cover Trees and their Applications;Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures;2022-07-11