Affiliation:
1. Rice University, USA
2. Intel Corporation, USA
3. UCLA, USA
Abstract
We introduce the Concurrent Collections (CnC) programming model. CnC supports flexible combinations of task and data parallelism while retaining determinism. CnC is implicitly parallel, with the user providing high-level operations along with semantic ordering constraints that together form a CnC graph. We formally describe the execution semantics of CnC and prove that the model guarantees deterministic computation. We evaluate the performance of CnC implementations on several applications and show that CnC offers performance and scalability equivalent to or better than that offered by lower-level parallel programming models.
Funder
National Science Foundation
Subject
Computer Science Applications,Software
Cited by
46 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. When Concurrency Matters: Behaviour-Oriented Concurrency;Proceedings of the ACM on Programming Languages;2023-10-16
2. An ownership policy and deadlock detector for promises;Proceedings of the 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming;2021-02-17
3. Chocola;ACM Transactions on Programming Languages and Systems;2021-02
4. Stateful dataflow multigraphs;Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis;2019-11-17
5. Efficient race detection with futures;Proceedings of the 24th Symposium on Principles and Practice of Parallel Programming;2019-02-16