Memory Hierarchies - Models and Lower Bounds / Peter Sanders1: |
Why Memory Hierarchies / 1.1: |
Current Technology / 1.2: |
Modeling / 1.3: |
Issues in External Memory Algorithm Design / 1.4: |
Lower Bounds / 1.5: |
Basic External Memory Data Structures / Rasmus Pagh2: |
Elementary Data Structures / 2.1: |
Dictionaries / 2.2: |
B-trees / 2.3: |
Hashing Based Dictionaries / 2.4: |
Dynamization Techniques / 2.5: |
Summary / 2.6: |
A Survey of Techniques for Designing I/O-Efficient Algorithms / Anil Maheshwari ; Norbert Zeh3: |
Introduction / 3.1: |
Basic Techniques / 3.2: |
Simulation of Parallel Algorithms in External Memory / 3.3: |
Time-Forward Processing / 3.4: |
Greedy Graph Algorithms / 3.5: |
List Ranking and the Euler Tour Technique / 3.6: |
Graph Blocking / 3.7: |
Remarks / 3.8: |
Elementary Graph Algorithms in External Memory / Irit Katriel ; Ulrich Meyer4: |
Graph-Traversal Problems: BFS, DFS, SSSP / 4.1: |
Undirected Breadth-First Search / 4.3: |
I/O-Efficient Tournament Trees / 4.4: |
Undirected SSSP with Tournament Trees / 4.5: |
Graph-Traversal in Directed Graphs / 4.6: |
Conclusions and Open Problems for Graph Traversal / 4.7: |
Graph Connectivity: Undirected CC, BCC, and MSF / 4.8: |
Connected Components / 4.9: |
Minimum Spanning Forest / 4.10: |
Randomized CC and MSF / 4.11: |
Biconnected Components / 4.12: |
Conclusion for Graph Connectivity / 4.13: |
I/O-Efficient Algorithms for Sparse Graphs / Laura Toma5: |
Definitions and Graph Classes / 5.1: |
Techniques / 5.3: |
Connectivity Problems / 5.4: |
Breadth-First Search and Single Source Shortest Paths / 5.5: |
Depth-First Search / 5.6: |
Graph Partitions / 5.7: |
Gathering Structural Information / 5.8: |
Conclusions and Open Problems / 5.9: |
External Memory Computational Geometry Revisited / Christian Breimann ; Jan Vahrenhold6: |
General Methods for Solving Geometric Problems / 6.1: |
Problems Involving Sets of Points / 6.3: |
Problems Involving Sets of Line Segments / 6.4: |
Problems Involving Set of Polygonal Objects / 6.5: |
Conclusions / 6.6: |
Full-Text Indexes in External Memory / Juha Kärkkäinen ; S. Srinivasa Rao7: |
Preliminaries / 7.1: |
I/O-efficient Queries / 7.3: |
External Construction / 7.5: |
Concluding Remarks / 7.6: |
Algorithms for Hardware Caches and TLB / Naila Rahman8: |
Caches and TLB / 8.1: |
Memory Models / 8.3: |
Algorithms for Internal Memory / 8.4: |
Cache Misses and Power Consumption / 8.5: |
Exploiting Other Memory Models: Advantages and Limitations / 8.6: |
Sorting Integers in Internal Memory / 8.7: |
Cache Oblivious Algorithms / Piyush Kumar9: |
The Model / 9.1: |
Algorithm Design Tools / 9.3: |
Matrix Transposition / 9.4: |
Matrix Multiplication / 9.5: |
Searching Using Van Emde Boas Layout / 9.6: |
Sorting / 9.7: |
Is the Model an Oversimplification? / 9.8: |
Other Results / 9.9: |
Open Problems / 9.10: |
Acknowledgements / 9.11: |
An Overview of Cache Optimization Techniques and Cache-Aware Numerical Algorithms / Markus Kowarschik ; Christian Weiß10: |
Architecture and Performance Evaluation of Caches / 10.1: |
Basic Techniques for Improving Cache Efficiency / 10.3: |
Cache-Aware Algorithms of Numerical Linear Algebra / 10.4: |
Memory Limitations in Artificial Intelligence / Stefan Edelkamp10.5: |
Hierarchical Memory / 11.1: |
Single-Agent Search / 11.3: |
Action Planning / 11.4: |
Game Playing / 11.5: |
Other AI Areas / 11.6: |
Algorithmic Approaches for Storage Networks / Kay A. Salzwedel11.7: |
Model / 12.1: |
Space and Access Balance / 12.3: |
Availability / 12.4: |
Heterogeneity / 12.5: |
Adaptivity / 12.6: |
An Overview of File System Architectures / Florin Isaila12.7: |
File Access Patterns / 13.1: |
File System Duties / 13.3: |
Distributed File Systems / 13.4: |
Exploitation of the Memory Hierarchy in Relational DBMSs / Josep-L. Larriba-Pey13.5: |
What to Expect and What Is Assumed / 14.1: |
DBMS Engine Structure / 14.3: |
Evidences of Locality in Database Workloads / 14.4: |
Basic Techniques for Locality Exploitation / 14.5: |
Exploitation of Locality by the Executor / 14.6: |
Access Methods / 14.7: |
Exploitation of Locality by the Buffer Pool Manager / 14.8: |
Hardware Related Issues / 14.9: |
Compilation for Locality Exploitation / 14.10: |
Hierarchical Models and Software Tools for Parallel Programming / Massimo Coppola ; Martin Schmollinger14.11: |
Architectural Background / 15.1: |
Parallel Computational Models / 15.3: |
Parallel Bridging Models / 15.4: |
Software Tools / 15.5: |
Case Study: Memory Conscious Parallel Sorting / Dani Jiménez-González ; Juan J. Navarro15.6: |
Architectural Aspects / 16.1: |
Sequential and Straight Forward Radix Sort Algorithms / 16.3: |
Memory Conscious Algorithms / 16.4: |
Acknowledgments / 16.5: |
Bibliography |
Index |
Memory Hierarchies - Models and Lower Bounds / Peter Sanders1: |
Why Memory Hierarchies / 1.1: |
Current Technology / 1.2: |
Modeling / 1.3: |
Issues in External Memory Algorithm Design / 1.4: |
Lower Bounds / 1.5: |