Write-Avoiding Algorithms

Communication, i.e., moving data between levels of a memory hierarchy or between processors over a network, is much more expensive (in time or energy) than arithmetic. There has thus been a recent focus on designing algorithms that minimize communication and, when possible, attain lower bounds on th...

Full description

Bibliographic Details

Published in:	Proceedings - IEEE International Parallel and Distributed Processing Symposium pp. 648 - 658
Main Authors:	Carson, Erin, Demmel, James, Grigori, Laura, Knight, Nicholas, Koanantakool, Penporn, Schwartz, Oded, Simhadri, Harsha Vardhan
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.05.2016
Subjects:	Algorithm design and analysis communication avoiding algorithms Hardware Krylov subspace methods Linear algebra Load modeling lower bounds N-body methods Non-volatile memories Nonvolatile memory Program processors Schedules write complexity
ISSN:	1530-2075
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!