Table of contents:
1: Introduction
2: Parallel Disk Model (PDM)
3: Fundamental I/O Operations and Bounds
4: Exploiting Locality and Load Balancing
5: External Sorting and Related Problems
6: Lower Bounds and I/O
7: Matrix and Grid Computations
8: Batched Problems in Computational Geometry
9: Batched Problems on Graphs
10: External Hashing for Online Dictionary Search
11: Multiway Tree Data Structures
12: Spatial Data Structures and Range Search
13: Dynamic and Kinetic Data Structures
14: String Processing
15: Compressed Data Structures
16: Dynamic Memory Allocation
17: External Memory Programming Environments
Conclusions
Notations and Acronyms
References