Auto-Blocking Matrix-Multiplication or Tracking BLAS3 Performance from Source Code (1997)
| Venue: | In Proceedings of the Sixth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming |
| Citations: | 69 - 6 self |
BibTeX
@INPROCEEDINGS{Frens97auto-blockingmatrix-multiplication,
author = {Jeremy Frens and David S. Wise},
title = {Auto-Blocking Matrix-Multiplication or Tracking BLAS3 Performance from Source Code},
booktitle = {In Proceedings of the Sixth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming},
year = {1997},
pages = {206--216}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
An elementary, machine-independent, recursive algorithm for matrix multiplication C+=A*B provides implicit blocking at every level of the memory hierarchy and tests out faster than classically optimal code, tracking hand-coded BLAS3 routines. ``Proof of concept'' is demonstrated by racing the in-place algorithm against manufacturer's hand-tuned BLAS3 routines; it can win. The recursive code bifurcates naturally at the top level into independent block-oriented processes, that each writes to a disjoint and contiguous region of memory. Experience has shown that the indexing vastly improves the patterns of memory access at all levels of the memory hierarchy, independently of the sizes of caches or pages and without ad hoc programming. It also exposed a weakness in SGI's C compilers that merrily unroll loops for the superscalar R8000 processor, but do not analogously unfold the base cases of the most elementary recursions. Such deficiencies might deter programmers from using this rich class of recursive algorithms.
