Algorithms for Memory Hierarchies, Advanced Lectures [Dagstuhl Research Seminar, March 10-14, 2002] - researchr publication

researchr

You are not signed in
Sign in
Sign up

Ulrich Meyer, Peter Sanders, Jop F. Sibeyn, editors, Algorithms for Memory Hierarchies, Advanced Lectures [Dagstuhl Research Seminar, March 10-14, 2002]. Volume 2625 of Lecture Notes in Computer Science, Springer, 2003.

Conference: Dagstuhl2003

Abstract is missing.

Memory Hierarchies - Models and Lower BoundsPeter Sanders. 1-13 [doi]

Basic External Memory Data StructuresRasmus Pagh. 14-35 [doi]

A Survey of Techniques for Designing I/O-Efficient AlgorithmsAnil Maheshwari, Norbert Zeh. 36-61 [doi]

Elementary Graph Algorithms in External MemoryIrit Katriel, Ulrich Meyer. 62-84 [doi]

I/O-Efficient Algorithms for Sparse GraphsLaura Toma, Norbert Zeh. 85-109 [doi]

External Memory Computational Geometry RevisitedChristian Breimann, Jan Vahrenhold. 110-148 [doi]

Full-Text Indexes in External MemoryJuha Kärkkäinen, S. Srinivasa Rao. 149-170 [doi]

Algorithms for Hardware Caches and TLBNaila Rahman. 171-192 [doi]

Cache Oblivious AlgorithmsPiyush Kumar. 193-212 [doi]

An Overview of Cache Optimization Techniques and Cache-Aware Numerical AlgorithmsMarkus Kowarschik, Christian Weiß. 213-232 [doi]

Memory Limitations in Artificial IntelligenceStefan Edelkamp. 233-250 [doi]

Algorithmic Approaches for Storage NetworksKay Salzwedel. 251-272 [doi]

An Overview of File System ArchitecturesFlorin Isaila. 273-289 [doi]

Exploitation of the Memory Hierarchy in Relational DBMSsJosep-Lluis Larriba-Pey. 290-319 [doi]

Hierarchical Models and Software Tools for Parallel ProgrammingMassimo Coppola, Martin Schmollinger. 320-354 [doi]

Case Study: Memory Conscious Parallel SortingDaniel Jiménez-González, Josep-Lluis Larriba-Pey, Juan J. Navarro. 355-377 [doi]

Bibliography379-420 [doi]

Index421-428 [doi]

runs on WebDSL