The program dependence graph and its use in optimization
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communications of the ACM
StreamIt: A Language for Streaming Applications
CC '02 Proceedings of the 11th International Conference on Compiler Construction
Capsules: expressing composable computations in a parallel programming model
Capsules: expressing composable computations in a parallel programming model
Applying the concurrent collections programming model to asynchronous parallel dense linear algebra
Proceedings of the 15th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
Task superscalar: using processors as functional units
HotPar'10 Proceedings of the 2nd USENIX conference on Hot topics in parallelism
Task Superscalar: An Out-of-Order Task Pipeline
MICRO '43 Proceedings of the 2010 43rd Annual IEEE/ACM International Symposium on Microarchitecture
Efficiently speeding up sequential computation through the n-way programming model
Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications
Parallel programming: design of an overview class
Proceedings of the 2011 ACM SIGPLAN X10 Workshop
Survey of scheduling techniques for addressing shared resources in multicore processors
ACM Computing Surveys (CSUR)
Concurrency and Computation: Practice & Experience
| Hi-index | 0.00 |
Parallel programming is hard. We present a new approach called Concurrent Collections (CnC). This paper briefly explains why writing a parallel program is hard in the current environment and introduces our new approach based on this perspective. In particular, a CnC program doesn't explicitly express the parallelism. It expresses the constraints on parallelism. These constraints remain valid regardless of the target architecture.