PetaBricks
Jason Ansel, Cy P. Chan, Yee Lok Wong et al. · Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation · 2009
It is often impossible to obtain a one-size-fits-all solution for high performance algorithms when considering different choices for data distributions, parallelism, transformations, and blocking. The best solution to these choices is often tightly coupled to different architectures, problem sizes, data, and available system resources. In some cases, completely different algorithms may provide the best performance. Current compiler and programming language techniques are able to change some of these parameters, but today there is no simple way for the programmer to express or the compiler to choose different algorithms to handle different parts of the data. Existing solutions normally can handle only coarse-grained, library level selections or hand coded cutoffs between base cases and recursive cases.
Cited by 355 works. doi:10.1145/1542476.1542481
Authors
References
- Journal of Physics: Conference Series
- LAPACK Users' Guide
- INSTITUTE OF PHYSICS PUBLISHING
- The Design and Implementation of FFTW3
- FFTW: an adaptive software architecture for the FFT
- Applied numerical linear algebra
- Applied Numerical Linear Algebra
- Roofline
- Automatically Tuned Linear Algebra Software
- The implementation of the Cilk-5 multithreaded language