A Simple Tiled Approach to Teaching Parallel Computing

This paper proposes a simple tiled approach to writing parallel algorithms. It is both easy to grasp by novice programmers, it clearly out-competes the traditional and much more complex blocking methods used in dense linear algebra. Its distribution-agnostic nature and the use of lazy and eager methods enables students to easily explore parallel program performance and understand parallel computing concepts. Indeed this approach is suitable for parallel programmers of all skill levels provided the algorithm of interest lends itself to the tiled approach.