This shows you the differences between two versions of the page.

Link to this comparison view

seminars:seminar_13_11_05 [2013/10/31 08:49]
seminars:seminar_13_11_05 [2017/09/20 22:02] (current)
Line 1: Line 1:
 +====== Generating Fast Matrix Multiply Kernels with Spiral ​ ======
 +====  Richard Veras ====
 +=== CMU ===
 +== Tuesday, November 5 4:30 PM ==
 +== HH D-210 ==
 +===== Abstract =====
 +Matrix-Matrix Multiplication (MMM) is a fundamental operation in scientific com-puting as it forms the foun-dation to many scientific libraries and applications. It is one of the few operations that can achieve the theoretical peaking floating point capacity and peak memory bandwidth of a conventional processor. ​
 +Unfortunately reaching this floating point peak requires expert knowledge of linear algebra and computer architecture to craft a tuned implementation for that par-ticular microarchitecture. The search space of possible MMM implementations is large and experts have found ways to traverse this space with models, optimizations and fine tuning. ​
 +In this talk we will show how we automated the domain expert in this field using Spiral, a framework for generating high performance code from formal descriptions. The end result: the performance of the Spiral generated code com-pares to hand written and tuned code on a variety of computer architectures.
 +===== Bio =====
 +Richard Veras is a third year PhD Student in the Electrical and Computer Engineering Department at Carnegie Mellon University. He is a member of the SPIRAL group and is being advised by Dr. Franz Franchetti. He earned his bachelors in Computer Science and Mathematics at the University of Texas at Austin and his research interests are in Automatic Program Generation, and Scientific and High Performance Computing.