Exploiting Implicit Parallelism in Dynamic Array Programming Languages
Shams Imam, Vivek Sarkar, David Leibs et al. · 2014
We have built an interpreter for the array programming language J. The interpreter exploits implicit data parallelism in the language to achieve good parallel speedups on a variety of benchmark applications.
Cited by 0 works. doi:10.1145/2627373.2627374
Authors
References
- Hadoop: The Definitive Guide
- Software transactional memory
- Amdahl's Law in the Multicore Era
- An implementation of F
- Self-optimizing AST interpreters
- Regular, shape-polymorphic, parallel arrays in Haskell
- Programming with idioms in APL
- An introduction to function rank
- The design and development of ZPL
- An introduction to function rank