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

Table of Contents:

• Memory Hierarchies - Models and Lower Bounds
• Basic External Memory Data Structures
• A Survey of Techniques for Designing I/O-Efficient Algorithms
• Elementary Graph Algorithms in External Memory
• I/O-Efficient Algorithms for Sparse Graphs
• External Memory Computational Geometry Revisited
• Full-Text Indexes in External Memory
• Algorithms for Hardware Caches and TLB
• Cache Oblivious Algorithms
• An Overview of Cache Optimization Techniques and Cache-Aware Numerical Algorithms
• Memory Limitations in Artificial Intelligence
• Algorithmic Approaches for Storage Networks
• An Overview of File System Architectures
• Exploitation of the Memory Hierarchy in Relational DBMSs
• Hierarchical Models and Software Tools for Parallel Programming
• Case Study: Memory Conscious Parallel Sorting.