Scalable and efficient linear algebra kernel mapping for low energy consumption on the layers CGRA

6Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A scalable mapping is proposed for 3 important kernels from the Numerical Linear Algebra domain, to exploit architectural features to reach asymptotically optimal efficiency and a low energy consumption. Performance and power evaluations were done with input data set matrix sizes ranging from 64×64 to 16384×16384. 12 architectural variants with up to 10×10 processing elements were used to explore scalability of the mapping and the architecture, achieving < 10% energy increase for architectures up to 8×8 PEs coupled with performance speed-ups of more than an order of magnitude. This enables a clean area-performance trade-off on the Layers architecture while keeping energy constant over the variants.

Cite

CITATION STYLE

APA

Rákossy, Z. E., Stengele, D., Acosta-Aponte, A., Chafekar, S., Bientinesi, P., & Chattopadhyay, A. (2015). Scalable and efficient linear algebra kernel mapping for low energy consumption on the layers CGRA. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9040, pp. 301–310). Springer Verlag. https://doi.org/10.1007/978-3-319-16214-0_25

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free