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

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

Advisor: 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://www.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://www.eecs.berkeley.edu/Pubs/TechRpts/2013/EECS-2013-100.html
%F Lipshitz:EECS-2013-100

---

Home

|      © UC Berkeley EECS

|      May 17, 2013 14:18

|      Contact Webteam