Live briefing
Everything about Communication-avoiding algorithm
Communication-avoiding algorithms minimize movement of data within a memory hierarchy for improving its running-time and energy consumption. These minimize the total of two costs : arithmetic and communication. Communication, in this context refers to moving data, either between levels of memory or between multiple processors over a network. It is much more expensive than arithmetic. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Communication-avoiding algorithmA 5-minute orientation
- Pick up a classic book: Modern Operating SystemsThe most-reprinted book on the subject
- Read the landmark paper: A communication-avoiding 3D algorithm for sparse LU factorization on heterogeneous systemsCited 17 times
- Go sideways: Matrix multiplication algorithmA closely related topic
- Go sideways: Discrete cosine transformA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
A communication-avoiding 3D algorithm for sparse LU factorization on heterogeneous systems
A Numerically Stable Communication-Avoiding \({s}\)-Step GMRES Algorithm
EA4RCA: Efficient AIE accelerator design framework for regular Communication-Avoiding Algorithm
Parallel Communication-Avoiding Algorithm for Triangular Matrix Inversion on Homogeneous and Heterogeneous Platforms
đź“š Books worth reading
Modern Operating SystemsAndrew S. Tanenbaum, Herbert Bos · 1992
Data Communications and NetworkingBehrouz A. Forouzan, Catherine Ann Coombs · 2000
Digital planetGeorge Beekman, Ben Beekman · 2011
Why programs failAndreas Zeller · 2005
TCP/IP IllustratedW. Richard Stevens, Kevin R. Fall · 1993
Virtual crowdsNuria Pelechano · 2008
The mathematics of Paul ErdösRonald L. Graham, Jaroslav Nešetřil · 1997
Professional mobile Web development with WordPress, Joomla!, and DrupalJames Pearce · 2011
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Matrix multiplication algorithm Because matrix multiplication is such a central operation in many numerical algorithms, much work has been invested in making matrix multiplication algorithms…
- Discrete cosine transform A discrete cosine transform (DCT) expresses a finite sequence of data points in terms of a sum of cosine functions oscillating at different frequencies…
- Computational complexity of matrix multiplication Unsolved problem in computer science What is the fastest algorithm for matrix multiplication? More unsolved problems in computer science In theoretical…
- Discrete Hartley transform A discrete Hartley transform (DHT) is a Fourier-related transform of discrete, periodic data similar to the discrete Fourier transform (DFT), with analogous…
- Cooley–Tukey FFT algorithm The Cooley–Tukey algorithm, named after J. W. Cooley and John Tukey, is the most common fast Fourier transform (FFT) algorithm. It re-expresses the discrete…
- Strassen algorithm In linear algebra, the Strassen algorithm, named after Volker Strassen, is an algorithm for matrix multiplication. It is faster than the standard matrix…
- Parallel external memory In computer science, a parallel external memory (PEM) model is a cache-aware, external-memory abstract machine. It is the parallel-computing analogy to…
- Parallel multidimensional digital signal processing Parallel multidimensional digital signal processing (mD-DSP) is defined as the application of parallel programming and multiprocessing to digital signal…