View Document Preview and Link Document Date: 2013-10-08 19:02:08 Open Document File Size: 465,14 KB Share Result on Facebook
City Toledo / New York / / Company NEC / Nokia / 3M / ACM Inc. / NVIDIA / Samsung / Intel / Microsoft / / Country United States / / Currency USD / / / Event Funding / / Facility Penn Plaza / University of California at Berkeley / University of California at Berkeley James Demmel / University of California / / / IndustryTerm dense matrix algorithms / matrix multiplication algorithm / parallel algorithms / classical algorithm / recent parallel algorithm / classical matrix multiplication algorithm / implement algorithms / restrictive networks / classical algorithms / sparse matrix algorithms / matrix multiplication algorithms / memory devices / energy / recursive algorithm / Communication cost optimal algorithms / similar algorithms / given algorithm / replacement product / sequential and parallel algorithms / parallel algorithm / similar optimal algorithm / parallel processors / / Organization University of California / U.S. Department of Energy / National Science Foundation / Par Lab / Department of Mathematics / Computer Science Division / Mathematics Department / Universitat / / Person Olga Holtz / Oded Schwartz / Lawrence Berkeley / James Demmel / / / Position first player / Matrices General / player / good programmer / Author / second player / / ProvinceOrState California / New York / / PublishedMedium Journal of the ACM / / Technology corresponding algorithm / implement algorithms / Strassen-like algorithm / Strassenlike algorithms / Strassen-like matrix multiplication algorithm / classical algorithm / dense matrix algorithms / sequential and parallel algorithms / parallel Strassen algorithm / parallel algorithm / recent parallel algorithm / Strassen-like matrix multiplication algorithms / Strassen-like algorithms / 0 algorithm / recursive algorithm / matrix multiplication algorithms / matrix multiplication algorithm / classical matrix multiplication algorithm / one processor / corresponding classical algorithms / sparse matrix algorithms / given algorithm / 0 Strassen-like algorithm / Communication-avoiding algorithms / / URL http / SocialTag 
A Graph Expansion and Communication Costs of Fast Matrix Multiplication Grey Ballard, University of California at Berkeley James Demmel, University of California at Berkeley ¨ Berlin