Provably good scheduling for parallel programs that use data structures through implicit batching-Reference-Cited by-同舟云学术

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

Published:2014-06-21 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures
language:
Short-container-title:

Author:

Agrawal Kunal¹,Fineman Jeremy T.²,Lu Kefu¹,Sheridan Brendan²,Sukha Jim³,Utterback Robert¹

Affiliation:

1. Washington University in St. Louis, St. Louis, USA

2. Georgetown University, Washington, DC, USA

3. Intel Corporation, , USA

Funder

Division of Computing and Communication Foundations

Publisher

ACM

Reference42 articles.

Cited by 22 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. Parallel k-Core Decomposition with Batched Updates and Asynchronous Reads;Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming;2024-02-20

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