Algorithms for Memory Hierarchies Advanced Lectures /

• Corporate Author: SpringerLink (Online service)
• Other Authors: Meyer, Ulrich (Editor, http://id.loc.gov/vocabulary/relators/edt), Sanders, Peter (Editor, http://id.loc.gov/vocabulary/relators/edt), Sibeyn, Jop (Editor, http://id.loc.gov/vocabulary/relators/edt)
• Format: Electronic eBook
• Language: English
• Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2003.
• Edition: 1st ed. 2003.
• Series: Lecture Notes in Computer Science, 2625
• Subjects: Computer engineering.; Algorithms.; Software engineering.; Operating systems (Computers).; Data structures (Computer science).; Computer Engineering.; Algorithm Analysis and Problem Complexity.; Software Engineering.; Operating Systems.; Data Storage Representation.; Data Structures and Information Theory.
• Physical Description: XV, 429 p. online resource.
• ISBN: 9783540365747
• ISSN: 0302-9743 ;
• DOI: 10.1007/3-540-36574-5

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.