Overview
- Includes supplementary material: sn.pub/extras
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 2625)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
About this book
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.
Similar content being viewed by others
Keywords
- Hardware
- algorithms
- artificial intelligence
- cache-oblivious algorithms
- computational geometry
- data structures
- data-intensive processing
- external memory
- external memory algorithms
- geometric computation
- memory access
- memory hierarchies
- programming
- searching
- shared memory systems
- algorithm analysis and problem complexity
Table of contents (16 chapters)
-
Front Matter
-
Back Matter
Editors and Affiliations
Bibliographic Information
Book Title: Algorithms for Memory Hierarchies
Book Subtitle: Advanced Lectures
Editors: Ulrich Meyer, Peter Sanders, Jop Sibeyn
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/3-540-36574-5
Publisher: Springer Berlin, Heidelberg
-
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 2003
Softcover ISBN: 978-3-540-00883-5Published: 07 April 2003
eBook ISBN: 978-3-540-36574-7Published: 01 July 2003
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XV, 429
Topics: Computer Engineering, Algorithm Analysis and Problem Complexity, Software Engineering, Operating Systems, Data Storage Representation, Data Structures and Information Theory