Let S a / 3M / Microsoft / Lawrence Berkeley National Laboratory / Intel / /
Country
Germany / / /
Event
Funding / /
Facility
University of California / The Weizmann Institute of Science / /
IndustryTerm
recursive algorithm / dot products / simpler optimal algorithms / parallel algorithms / network connecting processors / distributive law / graph theoretical algorithms / Communication-optimal algorithms / designed algorithms / conventional algorithm / sequential algorithm / dense and sparse linear algebra algorithms / to these algorithms / parallel algorithm / complicated accounting / overall algorithm / linear algebra algorithms / certain graph algorithms / conventional algorithms / /
OperatingSystem
L3 / /
Organization
U.S. Department of Energy / CS Division / Mathematics Department / Society for Industrial / University of California / Berkeley / Technische Universität Berlin / Computer Science Department / Weizmann Institute of Science / /
Person
OLGA HOLTZ / JAMES DEMMEL / ODED SCHWARTZ / /
Position
author / /
ProvinceOrState
California / /
Technology
sequential algorithm / one processor / linear algebra algorithms / graph theoretical algorithms / network connecting processors / overall algorithm / dense and sparse linear algebra algorithms / certain graph algorithms / least one processor / parallel algorithm / Strassen-like algorithms / Then at least one processor / recursive algorithm / Schmidt algorithm / conventional algorithm / /
SIAM J. MATRIX ANAL. & APPL. Vol. 32, No. 3, pp. 866–901 © 2011 Society for Industrial and Applied Mathematics MINIMIZING COMMUNICATION IN NUMERICAL