Algorithms for memory hierarchies : advanced lectures / Ulrich Meyer, Peter Sanders, Jop Sibeyn (eds.).

Contributor(s): Meyer, Ulrich, 1971- | Sanders, Peter, 1967- | Sibeyn, Jop
Material type: TextTextSeries: SerienbezeichnungLecture notes in computer science: 2625.Publisher: Berlin ; New York : Springer, 2003Description: 1 online resource (xvii, 428 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 9783540365747; 3540365745Subject(s): Computer algorithms | Data structures (Computer science) | Memory hierarchy (Computer science) | Algorithmes | Hiérarchie de mémoires (Informatique) | Structures de données (Informatique) | Computer algorithms | Data structures (Computer science) | Memory hierarchy (Computer science) | SpeicherhierarchieGenre/Form: Electronic books. Additional physical formats: Print version:: Algorithms for memory hierarchies : advanced lecturesDDC classification: 005.1 LOC classification: QA76.9.A43 | A435 2003Other classification: 54.31 | SS 4800 | 28 | DAT 406f | DAT 170f Online resources: Click here to access online
Contents:
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.
Summary: 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 model: while waiting for memory access, nowadays, microprocessors can in principle execute 1000 additions of registers; for hard disk access this factor can reach six orders of magnitude. The 16 coherent chapters in this monograph-like tutorial book introduce and survey algorithmic techniques used to achieve high performance on memory hierarchies; emphasis is placed on methods interesting from a theoretical as well as important from a practical point of view.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current location Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library

Electronic Book@IST

EBook Available
Total holds: 0

Includes bibliographical references (pages 379-420) and index.

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 model: while waiting for memory access, nowadays, microprocessors can in principle execute 1000 additions of registers; for hard disk access this factor can reach six orders of magnitude. The 16 coherent chapters in this monograph-like tutorial book introduce and survey algorithmic techniques used to achieve high performance on memory hierarchies; emphasis is placed on methods interesting from a theoretical as well as important from a practical point of view.

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.

English.

There are no comments for this item.

to post a comment.

Powered by Koha