Lecture Notes in Computer Science

Algorithms for Memory Hierarchies

Advanced Lectures

Editors: Meyer, Ulrich, Sanders, Peter, Sibeyn, Jop (Eds.)

Buy this book

eBook $74.99
price for USA (gross)
  • ISBN 978-3-540-36574-7
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $99.00
price for USA
  • ISBN 978-3-540-00883-5
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
About this Textbook

 

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.

Table of contents (7 chapters)

  • Memory Hierarchies — Models and Lower Bounds

    Peter Sanders

    Pages 1-13

  • Basic External Memory Data Structures

    Rasmus Pagh

    Pages 14-35

  • A Survey of Techniques for Designing I/O-Efficient Algorithms

    Anil Maheshwari, Norbert Zeh

    Pages 36-61

  • Cache Oblivious Algorithms

    Piyush Kumar

    Pages 193-212

  • An Overview of Cache Optimization Techniques and Cache-Aware Numerical Algorithms

    Markus Kowarschik, Christian Weiß

    Pages 213-232

Buy this book

eBook $74.99
price for USA (gross)
  • ISBN 978-3-540-36574-7
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $99.00
price for USA
  • ISBN 978-3-540-00883-5
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Loading...

Recommended for you

Loading...

Bibliographic Information

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
Series Volume
2625
Copyright
2003
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-540-36574-7
DOI
10.1007/3-540-36574-5
Softcover ISBN
978-3-540-00883-5
Series ISSN
0302-9743
Edition Number
1
Number of Pages
XV, 429
Topics