Skip to main content

Algorithms for Memory Hierarchies

Advanced Lectures

  • Textbook
  • © 2003

Overview

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 2625)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

eBook USD 9.99 USD 39.99
Discount applied Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

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

Table of contents (16 chapters)

Editors and Affiliations

  • Max-Planck-Institut für Informatik, Saarbrücken, Germany

    Ulrich Meyer, Peter Sanders

  • Institut für Informatik, Martin-Luther-Universität Halle-Wittenberg, Halle, Germany

    Jop Sibeyn

Bibliographic Information

Publish with us