Section: Partnerships and Cooperations

International Initiatives

Inria International Labs

Inria@SiliconValley

Associate Team involved in the International Lab:

COALA

• Title: Communication Optimal Algoritms for Linear Algebra

• International Partner (Institution - Laboratory - Researcher):

  • University of California Berkeley (United States) - Electrical Engineering and Computer Science (EECS) - James Demmel

• Start year: 2010

• See also: https://who.rocq.inria.fr/Laura.Grigori/COALA2010/coala.html

• Our goal is to continue COALA associated team that focuses on the design and implementation of numerical algorithms for today's large supercomputers formed by thousands of multicore processors, possibly with accelerators. We focus on operations that are at the heart of many scientific applications as solving linear systems of equations or least squares problems. The algorithms belong to a new class referred to as communication avoiding that provably minimize communication, where communication means the data transferred between levels of memory hierarchy or between processors in a parallel computer. This research is motivated by studies showing that communication costs can already exceed arithmetic costs by orders of magnitude, and the gap is growing exponentially over time. An important aspect that we consider here is the validation of the algorithms in real applications through our collaborations. COALA is an Inria associate team that focuses on the design and implementation of numerical algorithms for today's large supercomputers formed by thousands of multicore processors, possibly with accelerators. We focus on operations that are at the heart of many scientific applications as solving linear systems of equations or least squares problems. The algorithms belong to a new class referred to as communication avoiding that provably minimize communication, where communication means the data transferred between levels of memory hierarchy or between processors in a parallel computer. This research is motivated by studies showing that communication costs can already exceed arithmetic costs by orders of magnitude, and the gap is growing exponentially over time. An important aspect that we consider here is the validation of the algorithms in real applications through our collaborations.