PPT-Communication-Avoiding Algorithms

Author : celsa-spraggs | Published Date : 2015-09-21

for Linear Algebra and Beyond Jim Demmel EECS amp Math Departments UC Berkeley 2 Why avoid communication 13 Algorithms have two costs measured in time or energy

Presentation Embed Code

Download Presentation

Download Presentation The PPT/PDF document "Communication-Avoiding Algorithms" is the property of its rightful owner. Permission is granted to download and print the materials on this website for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.

Communication-Avoiding Algorithms: Transcript

for Linear Algebra and Beyond Jim Demmel EECS amp Math Departments UC Berkeley 2 Why avoid communication 13 Algorithms have two costs measured in time or energy Arithmetic FLOPS Communication moving data between . Multigrid. Erin . C. . Carson. 1. Samuel Williams. 2. , Michael Lijewski. 2. , Nicholas Knight. 1. , . Ann . S. . Almgren. 2. , James Demmel. 1. , and Brian Van Straalen. 1,2. 1. University of California, Berkeley, USA. Communication-Avoiding . Algorithms. www.cs.berkeley.edu. /~. demmel. /SC11_tutorial. Jim . Demmel. EECS & Math Departments. UC Berkeley. 2. Why avoid communication? (1/2). Algorithms have two costs (measured in time or energy):. Keep the conversation flowing!. What is a communication strategy?. “potentially conscious plans for solving what to an individual presents itself as a problem in reaching a particular communicative goal.”. Avoiding Run-on Sentences. The length of a sentence has nothing to do with whether or not a sentence is considered a run-on. An over-exuberant, run-off-at-the-mouth, 400-word gorilla of a sentence can be structurally fine. A . Algorithms. for. Dense Linear Algebra. Jim . Demmel. CS294, Lecture . #4 . Fall, 2011. Communication-Avoiding Algorithms. www.cs.berkeley.edu/~odedsc/CS294. Based on:. Bootcamp. 2011, CS267, Summer-school 2010, many papers. Erin Carson, Jim Demmel, Laura . Grigori. , Nick Knight, . Penporn. . Koanantakool. , . Oded. Schwartz, . Harsha. . Simhadri. Slides based on. ASPIRE Retreat, June 2015. 1. Outline. Strassen. Multigrid. Erin . C. . Carson. 1. Samuel Williams. 2. , Michael Lijewski. 2. , Nicholas Knight. 1. , . Ann . S. . Almgren. 2. , James Demmel. 1. , and Brian Van Straalen. 1,2. 1. University of California, Berkeley, USA. Iterative Methods. Erin Carson. UC Berkeley Parallel Computing Lab. BeBop. Group. Discovery 2015: HPC and Cloud Computing. Workshop, June 2011. President . Obama. cites Communication Avoiding algorithms in the FY 2012 Department of Energy Budget Request to Congress:. 2012-2013. Qualified Allocation Plan . Forum. September 5, 2012. Avoiding Technical Corrections. Overview. 67 developments applied for tax credits in the 2012 Round. 14 projects were awarded credits. Multigrid. Erin . C. . Carson. 1. Samuel Williams. 2. , Michael Lijewski. 2. , Nicholas Knight. 1. , . Ann . S. . Almgren. 2. , James Demmel. 1. , and Brian Van Straalen. 1,2. 1. University of California, Berkeley, USA. Krylov. . s. ubspace . m. ethods . Erin Carson and James . Demmel. Householder Symposium XIX. June 8-13, 2014, Spa, Belgium. 2. Model Problem: 2D . Poisson on . grid. , . . .. . Equilibration . (diagonal scaling) used. . Envelope Communication . BEC Symposium . Mike McKinnon. General Superintendent. 35 . Yrs. in industry, 30 . yrs. Hoar, 20 years in Houston. Superintendent, not a presenter, I'm a builder!!. Walk fast, talk fast, and look worried. Multigrid. Erin . C. . Carson. 1. Samuel Williams. 2. , Michael Lijewski. 2. , Nicholas Knight. 1. , . Ann . S. . Almgren. 2. , James Demmel. 1. , and Brian Van Straalen. 1,2. 1. University of California, Berkeley, USA. Jim . Demmel. EECS & Math Departments. UC Berkeley. Why avoid communication? . Communication = moving data. Between level of memory hierarchy. Between processors over a network. Running time of an algorithm is sum of 3 terms:.

Download Document

Here is the link to download the presentation.
"Communication-Avoiding Algorithms"The content belongs to its owner. You may download and print it for personal use, without modification, and keep all copyright notices. By downloading, you agree to these terms.