Communication-Avoiding Parallel Recursive Algorithms for Matrix Multiplication

Benjamin Lipshitz

EECS Department, University of California, Berkeley

Technical Report No. UCB/EECS-2013-100

May 17, 2013

This publication is archived. It is kept only for reference purposes, so it is no longer being updated and may not meet accessibility standards. If you need this content in a different format, please email webteam@eecs.berkeley.edu.

http://www2.eecs.berkeley.edu/Pubs/TechRpts/2013/Archive/EECS-2013-100.pdf

Advisors: James Demmel

BibTeX citation:

@mastersthesis{Lipshitz:EECS-2013-100,
    Author= {Lipshitz, Benjamin},
    Title= {Communication-Avoiding Parallel Recursive Algorithms for Matrix Multiplication},
    School= {EECS Department, University of California, Berkeley},
    Year= {2013},
    Month= {May},
    Url= {http://www2.eecs.berkeley.edu/Pubs/TechRpts/2013/EECS-2013-100.html},
    Number= {UCB/EECS-2013-100},
}

EndNote citation:

%0 Thesis
%A Lipshitz, Benjamin 
%T Communication-Avoiding Parallel Recursive Algorithms for Matrix Multiplication
%I EECS Department, University of California, Berkeley
%D 2013
%8 May 17
%@ UCB/EECS-2013-100
%U http://www2.eecs.berkeley.edu/Pubs/TechRpts/2013/EECS-2013-100.html
%F Lipshitz:EECS-2013-100