ENGLISH

Algorithms for Memory Hierarchies: Advanced Lectures

By Ulrich Meyer , Peter Sanders , Peter Sanders (auth.) , Jop Sibeyn (eds.)

Book information

Publisher
Springer-Verlag Berlin Heidelberg
Year
2003
ISBN
9783540008835, 3540008837
DOI
10.1007/3-540-36574-5
Open Library ID
OL9355922M
Language
english
Format
PDF
Filesize
4 MB (3745803 bytes)
Series
Lecture Notes in Computer Science 2625
Edition
1
Pages
429\442
Time added
2009-08-06 05:14:26
Algorithm Analysis and Problem Complexity; Softwar

Description

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.

Similar books