Sciweavers

PC
2016

Writing a performance-portable matrix multiplication

8 years 8 months ago
Writing a performance-portable matrix multiplication
There are several frameworks that, while providing functional portability of code across different platforms, do not automatically provide performance portability. As a consequence, programmers have to hand-tune the kernel codes for each device. The Heterogeneous Programming Library (HPL) is one of these libraries, but it has the interesting feature that the kernel codes, which implement the computation to be performed, are generated at runtime. This run-time code generation (RTCG) capability can be used, in conjunction with generic parameterized algorithms, to write performanceportable codes. In this paper we explain how these techniques can be applied to a matrix multiplication algorithm. The performance of our implementation is compared to two state-of-the-art adaptive implementations, clBLAS and ViennaCL, on four different platforms, achieving average speedups with
Jorge F. Fabeiro, Diego Andrade, Basilio B. Frague
Added 08 Apr 2016
Updated 08 Apr 2016
Type Journal
Year 2016
Where PC
Authors Jorge F. Fabeiro, Diego Andrade, Basilio B. Fraguela
Comments (0)