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.

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