Title :
Communication avoiding algorithms
Author_Institution :
EECS Department, UC Berkeley, CA, USA
Abstract :
This article consists of a collection of slides from the author´s conference presentation. Some of the specific areas/topics discussed include: To redesign algorithms to avoid communication between all memory hierarchy levels: L1 and L2 and DRAM and network, etc; To Attain lower bounds if possible (Current algorithms often far from lower bounds); Large speedups and energy savings are possible.
Conference_Titel :
High Performance Computing, Networking, Storage and Analysis (SCC), 2012 SC Companion:
Conference_Location :
Salt Lake City, UT
Print_ISBN :
978-1-4673-6218-4
DOI :
10.1109/SC.Companion.2012.351
