Algorithms for Memory Hierarchies: Advanced Lectures

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

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.

Table of contents :
Memory Hierarchies — Models and Lower Bounds….Pages 1-13
Basic External Memory Data Structures….Pages 14-35
A Survey of Techniques for Designing I/O-Efficient Algorithms….Pages 36-61
Elementary Graph Algorithms in External Memory….Pages 62-84
I/O-Efficient Algorithms for Sparse Graphs….Pages 85-109
External Memory Computational Geometry Revisited….Pages 110-148
Full-Text Indexes in External Memory….Pages 149-170
Algorithms for Hardware Caches and TLB….Pages 171-192
Cache Oblivious Algorithms….Pages 193-212
An Overview of Cache Optimization Techniques and Cache-Aware Numerical Algorithms….Pages 213-232
Memory Limitations in Artificial Intelligence….Pages 233-250
Algorithmic Approaches for Storage Networks….Pages 251-272
An Overview of File System Architectures….Pages 273-289
Exploitation of the Memory Hierarchy in Relational DBMSs….Pages 290-319
Hierarchical Models and Software Tools for Parallel Programming….Pages 320-354
Case Study: Memory Conscious Parallel Sorting….Pages 355-377