Algorithms for Memory Hierarchies Advanced Lectures /
Algorithms for Memory Hierarchies Advanced Lectures / [electronic resource] :
edited by Ulrich Meyer, Peter Sanders, Jop Sibeyn.
- 1st ed. 2003.
- XV, 429 p. online resource.
- Lecture Notes in Computer Science, 2625 1611-3349 ; .
- Lecture Notes in Computer Science, 2625 .
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.
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.
9783540365747
10.1007/3-540-36574-5 doi
Computer engineering.
Computer networks .
Algorithms.
Software engineering.
Operating systems (Computers).
Information retrieval.
Computer architecture.
Data structures (Computer science).
Information theory.
Computer Engineering and Networks.
Algorithms.
Software Engineering.
Operating Systems.
Data Storage Representation.
Data Structures and Information Theory.
TK7885-7895 TK5105.5-5105.9
621.39 004.6
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.
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.
9783540365747
10.1007/3-540-36574-5 doi
Computer engineering.
Computer networks .
Algorithms.
Software engineering.
Operating systems (Computers).
Information retrieval.
Computer architecture.
Data structures (Computer science).
Information theory.
Computer Engineering and Networks.
Algorithms.
Software Engineering.
Operating Systems.
Data Storage Representation.
Data Structures and Information Theory.
TK7885-7895 TK5105.5-5105.9
621.39 004.6