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. |
Year | DOI | Venue |
---|---|---|
2010 | 10.3233/SPR-2011-0305 | Scientific Programming |
Keywords | DocType | Volume |
deterministic computation,CnC implementation,CnC graph,execution semantics,Concurrent Collections,programming model,data parallelism,lower-level parallel programming model,high-level operation,flexible combination | Journal | 18 |
Issue | Citations | PageRank |
3-4 | 26 | 1.20 |
References | Authors | |
6 | 11 |
Name | Order | Citations | PageRank |
---|---|---|---|
Zoran Budimlić | 1 | 297 | 28.95 |
Michael Burke | 2 | 26 | 1.20 |
Vincent Cavé | 3 | 260 | 13.00 |
Kathleen Knobe | 4 | 388 | 60.03 |
Geoff Lowney | 5 | 2140 | 136.12 |
Ryan Newton | 6 | 26 | 1.20 |
Jens Palsberg | 7 | 2071 | 227.45 |
David Peixotto | 8 | 118 | 6.49 |
Vivek Sarkar | 9 | 4318 | 409.41 |
Frank Schlimbach | 10 | 88 | 6.13 |
Sağnak Taşırlar | 11 | 56 | 2.81 |