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...

Celý popis

Podrobná bibliografia

Vydané v:	Proceedings - IEEE International Parallel and Distributed Processing Symposium s. 648 - 658
Hlavní autori:	Carson, Erin, Demmel, James, Grigori, Laura, Knight, Nicholas, Koanantakool, Penporn, Schwartz, Oded, Simhadri, Harsha Vardhan
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.05.2016
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!