OTHER CALENDARSABOUT THE CALENDARMORE RESOURCES 
CommunicationAvoiding Parallel Algorithms for Dense Linear Algebra and Tensor Computations: Scientific Computing and Matrix Computations SeminarSeminar: Departmental  February 6  12:101 p.m.  380 Soda Hall Edgar Solomonik, UC Berkeley Electrical Engineering and Computer Sciences (EECS) The motivating electronic structure calculation methods for this work are Density Functional Theory (DFT), which employs dense linear algebra, and Coupled Cluster, a method for highly correlated systems, which relies heavily on contractions of symmetric tensors. I will introduce 2.5D algorithms, an extension of 3D algorithms, which are designed to minimize communication between processors. These parallel algorithms employ limited datareplication to asymptotically lower communication costs with respect to standard (ScaLAPACK/Elemental) 2D algorithms. In particular, we can reduce the amount of data sent along the critical path of execution in matrix multiplication, LU, Cholesky, and QR factorizations, triangular solve, and the symmetric eigenvalue problem. The amount of messages sent is reduced for some of these algorithms but increased for others. This interesting discrepancy will be justified by lowerbound proofs which show the interdependence of latency and bandwidth costs. The algorithms are practical, which we demonstrate by presenting largescale parallel results of a subset of these algorithms. odedsc@cs.berkeley.edu, 5105164321 

EECS Home  Contact WebTeam
Copyright © 2014 UC Regents
