Algorithms for Memory Hierarchies

 Algorithms that have to process large data sets have to take into account that the cost of memory access depends on where the data is stored. Traditional algorithm design is based on the von Neumann model where accesses to memory have uniform cost. Actual machines increasingly deviate from this model: while waiting for memory access, nowadays, microprocessors can in principle execute 1000 additions of registers; for hard disk access this factor can reach six orders of magnitude.The 16 coherent chapters in this monograph-like tutorial book introduce and survey algorithmic techniques used to achieve high performance on memory hierarchies; emphasis is placed on methods interesting from a theoretical as well as important from a practical point of view.

General

ISBN		9783540008835
Fiction/Non-Fiction		Non-Fiction
Publisher		Springer Verlag
Pages		428
List Price		$99.00
Author		Meyer, Ulrich Sanders, Peter Sibeyn, Jop
Publication Date		08/01/2003
Release Status		In Print
Format		Paperback
Language		English
Measurements		Height: 9 Inches (US) Width: 6.25 Inches (US) Thickness: 1 Inches (US) Unit Weight: 1.6 Pounds (US)
Series		Lecture Notes in Computer Science
Editor		Meyer, Ulrich Sanders, Peter Sibeyn, Jop