Provably Efficient Scheduling of Cache-oblivious Wavefront Algorithms-Reference-Cited by-同舟云学术

Provably Efficient Scheduling of Cache-oblivious Wavefront Algorithms

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

Author:

Chowdhury Rezaul¹,Ganapathi Pramod¹,Tang Yuan²,Tithi Jesmin Jahan³

Affiliation:

1. Stony Brook University, Stony Brook, NY, USA

2. Fudan University, Shanghai, China

3. Intel Corporation, Santa Clara, CA, USA

Funder

National Science Foundation

Publisher

ACM

Link

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

Reference53 articles.

1. Comet Supercomputing Cluster. http://www.sdsc.edu/support/user_guides/comet.html. (2016). Comet Supercomputing Cluster. http://www.sdsc.edu/support/user_guides/comet.html. (2016).

2. PAPI-5.3. http://icl.cs.utk.edu/papi/index.html. (2016). PAPI-5.3. http://icl.cs.utk.edu/papi/index.html. (2016).

3. Stampede Supercomputing Cluster. https://www.tacc.utexas.edu/stampede/. (2016). Stampede Supercomputing Cluster. https://www.tacc.utexas.edu/stampede/. (2016).

4. Shaizeen Aga Sriram Krishnamoorthy and Satish Narayanasamy. 2015. CilkSpec: optimistic concurrency for Cilk. In SC. 83. 10.1145/2807591.2807597 Shaizeen Aga Sriram Krishnamoorthy and Satish Narayanasamy. 2015. CilkSpec: optimistic concurrency for Cilk. In SC. 83. 10.1145/2807591.2807597

5. Kunal Agrawal Charles E Leiserson and Jim Sukha. 2010. Executing task graphs using work-stealing. In IPDPS. 1--12. Kunal Agrawal Charles E Leiserson and Jim Sukha. 2010. Executing task graphs using work-stealing. In IPDPS. 1--12.

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

1. BrickDL: Graph-Level Optimizations for DNNs with Fine-Grained Data Blocking on GPUs;Proceedings of the 53rd International Conference on Parallel Processing;2024-08-12

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

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. Parallel Cover Trees and their Applications;Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures;2022-07-11

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