Tiled linear algebra a system for parallel graph algorithms

  • Saeed Maleki ,
  • G. Carl Evans ,
  • David A. Padua

2014 Languages and Compilers for Parallel Computing |

Published by Springer, Cham

Publication | Publication | Publication | Publication

High performance parallel kernels for solving graph problems are complex and difficult to write. Some systems have been developed to facilitate the implementation of these kernels but the code they produce does not always perform as well as custom software. In this space, we propose Tiled Linear Algebra (TLA), a multi-level system based on linear algebra but with explicit parallel extensions. Programs can be first written in a conventional manner using linear algebra and then tuned for parallel performance using our extension. This separation allows programmers with different expertise to focus on their strengths with writing original codes that can then be tuned by parallel experts.