Concurrent Collections
Zoran Budimlić, Michael Burke, Vincent Cavé et al. · Scientific Programming · 2010
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.
Cited by 141 works. doi:10.1155/2010/521797 Open-access PDF
Authors
- Zoran Budimlić
- Michael Burke
- Vincent Cavé
- Kathleen Knobe
- Geoff N. Lowney
- Ryan Newton
- Jens Palsberg
- David M. Peixotto
- Vivek Sarkar
- F. Schlimbach
- Sağnak Taşırlar
References
- Dryad
- Generative communication in Linda
- The PARSEC benchmark suite
- X10
- Intel threading building blocks : outfitting C++ for multi-core processor parallelism
- LabVIEW for Everyone: Graphical Programming Made Easy and Fun
- Java Concurrency in Practice
- A type and effect system for deterministic parallel Java
- LabVIEW for Everyone: Graphical Programming Made Easy and Fun (3rd Edition) (National Instruments Virtual Instrumentation Series)
- The rise and fall of High Performance Fortran