Algorithms for Memory Hierarchies : Advanced Lectures
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 mode...
Guardat en:
| Altres autors: | , , |
|---|---|
| Format: | Livre numérique |
| Idioma: | Anglais |
| Publicat: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Col·lecció: | Lecture notes in computer science
2625 |
| Matèries: | |
| Accés en línia: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Algorithms for memory hierarchies, advanced lectures, Ulrich Meyer, Peter Sanders, Jop Sibeyn (eds.), Berlin, Springer, 2003, 1 vol. (XVII-428 p.), Lecture notes in computer science, 3-540-00883-7 • Algorithms for Memory Hierarchies, Texte imprimé, 9783662190630 |
Taula de continguts:
- 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.