default search action
Dagstuhl Research Seminar: Algorithms for Memory Hierarchies 2002
- Ulrich Meyer, Peter Sanders, Jop F. Sibeyn:
Algorithms for Memory Hierarchies, Advanced Lectures [Dagstuhl Research Seminar, March 10-14, 2002]. Lecture Notes in Computer Science 2625, Springer 2003, ISBN 3-540-00883-7 - Peter Sanders:
Memory Hierarchies - Models and Lower Bounds. 1-13 - Rasmus Pagh:
Basic External Memory Data Structures. 14-35 - Anil Maheshwari, Norbert Zeh:
A Survey of Techniques for Designing I/O-Efficient Algorithms. 36-61 - Irit Katriel, Ulrich Meyer:
Elementary Graph Algorithms in External Memory. 62-84 - Laura Toma, Norbert Zeh:
I/O-Efficient Algorithms for Sparse Graphs. 85-109 - Christian Breimann, Jan Vahrenhold:
External Memory Computational Geometry Revisited. 110-148 - Juha Kärkkäinen, S. Srinivasa Rao:
Full-Text Indexes in External Memory. 149-170 - Naila Rahman:
Algorithms for Hardware Caches and TLB. 171-192 - Piyush Kumar:
Cache Oblivious Algorithms. 193-212 - Markus Kowarschik, Christian Weiß:
An Overview of Cache Optimization Techniques and Cache-Aware Numerical Algorithms. 213-232 - Stefan Edelkamp:
Memory Limitations in Artificial Intelligence. 233-250 - Kay Salzwedel:
Algorithmic Approaches for Storage Networks. 251-272 - Florin Isaila:
An Overview of File System Architectures. 273-289 - Josep Lluís Larriba-Pey:
Exploitation of the Memory Hierarchy in Relational DBMSs. 290-319 - Massimo Coppola, Martin Schmollinger:
Hierarchical Models and Software Tools for Parallel Programming. 320-354 - Daniel Jiménez-González, Josep Lluís Larriba-Pey, Juan J. Navarro:
Case Study: Memory Conscious Parallel Sorting. 355-377 - Bibliography. 379-420
- Index. 421-428
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.