Algorithms for Memory Hierarchies: Advanced Lectures (Lecture Notes in Computer Science) (Paperback)

by Ulrich Meyer (Editor), Peter Sanders (Editor), Jop Sibeyn (Editor) "There are too many possible developments to explain or even perceive all of them in detail but a few basic trends should be noted..." (more)
Key Phrases: middle subsegments, internal memory setting, lexicographic naming, Hash Join, Nested Loop Join, Springer-Verlag Berlin Heidelberg (more...)

Editorial Reviews

Product Description

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.

Product Details

• Paperback: 428 pages
• Publisher: Springer; 1 edition (July 29, 2003)
• Language: English
• ISBN-10: 3540008837
• ISBN-13: 978-3540008835
• Product Dimensions: 9.2 x 6.1 x 1 inches
• Shipping Weight: 1.5 pounds (View shipping rates and policies)
• Average Customer Review: No customer reviews yet. Be the first.
• Amazon.com Sales Rank: #2,293,411 in Books (See Bestsellers in Books)