EngineeringComputer EngineeringComputer ScienceAlgorithmsComputer ArchitectureParallel AlgorithmsDirect Memory AccessMemory HierarchyMemory Hierarchy DesignMemory Hierarchy OptimizationMemory Subsystem DesignVirtual MemoryCommunication AvoidanceCommunication MinimizationCommunication-avoiding AlgorithmsCommunication-avoiding ReductionLower BoundsMemory Hierarchy AlgorithmsMemory Hierarchy AnalysisMemory-bounded Algorithms
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.