Algorithms for Memory Hierarchies

Advanced Lectures

Ulrich Meyer, Peter Sanders, Jop Sibeyn

446 pages, parution le 14/05/2003

Ajouter à une liste

Indisponible

Résumé

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.

Keywords: memory hierarchies, memory access, algorithm design, data-intensive processing, external memory algorithms, data structures, external graph algorithms, geometric computation, cache-oblivious algorithms, searching, sorting, shared memory systems.

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
Bibliography
Index

L'auteur - Ulrich Meyer

Max-Planck-Institut für Informatik, Saarbrücken, Germany

L'auteur - Peter Sanders

Max-Planck-Institut für Informatik, Saarbrücken, Germany

L'auteur - Jop Sibeyn

University of Halle, Germany (Eds.)

Caractéristiques techniques

	PAPIER
Éditeur(s)	Springer
Auteur(s)	Ulrich Meyer, Peter Sanders, Jop Sibeyn
Parution	14/05/2003
Nb. de pages	446
Format	15,6 x 23,5
Couverture	Broché
Poids	666g
Intérieur	Noir et Blanc
EAN13	9783540008835