Extending the Nested Parallel Model to the Nested Dataflow Model with Provably Efficient Schedulers-Reference-Cited by-同舟云学术

Extending the Nested Parallel Model to the Nested Dataflow Model with Provably Efficient Schedulers

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

Author:

Dinh David¹,Simhadri Harsha Vardhan²,Tang Yuan³

Affiliation:

1. University of California, Berkeley, Berkeley, CA, USA

2. Lawrence Berkeley National Lab, Berkeley, CA, USA

3. Fudan University, Shanghai Key Lab. of Intelligent Information Processing, Shanghai, China

Funder

Google

Nvidia

Defense Advanced Research Projects Agency

Intel Corporation

Mathworks

U.S. Department of Energy

Oracle

Samsung

Shanghai government

Huawei Technologies

Publisher

ACM

Link

Reference44 articles.

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

1. Teaching Parallel Algorithms Using the Binary-Forking Model;2024 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW);2024-05-27

2. Provably Fast and Space-Efficient Parallel Biconnectivity;Proceedings of the 28th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming;2023-02-21

3. Many Sequential Iterative Algorithms Can Be Parallel and (Nearly) Work-efficient;Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures;2022-07-11

4. Efficient Stepping Algorithms and Implementations for Parallel Shortest Paths;Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures;2021-07-06

5. Optimal Parallel Algorithms in the Binary-Forking Model;Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures;2020-07-06