| Document Date: 2013-10-08 19:17:49
Open Document File Size: 2,67 MBShare Result on Facebook
Company Solving Two-Sided Triangular Linear Systems / Computer Sciences / / Facility Engineering University of California / University of California / / IndustryTerm communication lower bounds and new algorithms / matrix multiplication algorithm / communication-efficient algorithms / sequential and parallel algorithms / communication-optimal algorithm / classical and fast algorithms / sharedmemory parallel algorithms / linear systems / linear algebra algorithms / matrix multiplication algorithms / scientific computing / distributed-memory parallel algorithms / / Organization Thesis Organization / University of California / Berkeley Committee / Graduate Division / / Person Berkeley Professor James Demmel / Ming Gu Professor Katherine Yelick / James Demmel / Katherine Yelick Fall / / Position author / Professor / Chair / / ProvinceOrState California / / Technology 88 89 90 91 92 93 94 95 8 Parallel Algorithms / alternative sharedmemory parallel algorithms / linear algebra algorithms / Block-Aasen Algorithm / alternative sequential and parallel algorithms / sequential and parallel algorithms / Rectangular Matrix Multiplication Algorithms / 6.1 Strassen-like Algorithms / 10.3 Sequential Band Tridiagonalization Algorithms / alternative distributed-memory parallel algorithms / 4.2 Strassen-Winograd Algorithm / Strassen-like Algorithms / 84 7 Sequential Algorithms / 9.1 Block-Aasen Algorithm / 3.1 Classical Algorithms / matrix multiplication algorithms / matrix multiplication algorithm / 10.4 Parallel Band Tridiagonalization Algorithms / / URL http /
SocialTag |
Avoiding Communication in Dense Linear Algebra Grey Ballard Electrical Engineering and Computer Sciences University of California at Berkeley