Algorithms for Memory Hierarchies

Advanced Lectures

  • Ulrich Meyer
  • Peter Sanders
  • Jop Sibeyn

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

Table of contents

  1. Front Matter
    Pages I-XVII
  2. Rasmus Pagh
    Pages 14-35
  3. Anil Maheshwari, Norbert Zeh
    Pages 36-61
  4. Irit Katriel, Ulrich Meyer
    Pages 62-84
  5. Laura Toma, Norbert Zeh
    Pages 85-109
  6. Christian Breimann, Jan Vahrenhold
    Pages 110-148
  7. Juha Kärkkäinen, S. Srinivasa Rao
    Pages 149-170
  8. Naila Rahman
    Pages 171-192
  9. Piyush Kumar
    Pages 193-212
  10. Stefan Edelkamp
    Pages 233-250
  11. Kay A. Salzwedel
    Pages 251-272
  12. Florin Isaila
    Pages 273-289
  13. Massimo Coppola, Martin Schmollinger
    Pages 320-354
  14. Dani Jiménez-González, Josep-L. Larriba-Pey, Juan J. Navarro
    Pages 355-377
  15. Back Matter
    Pages 379-428

About this book

Introduction

 

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.

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

Editors and affiliations

  • Ulrich Meyer
    • 1
  • Peter Sanders
    • 1
  • Jop Sibeyn
    • 2
  1. 1.Max-Planck-Institut für InformatikSaarbrückenGermany
  2. 2.Institut für InformatikMartin-Luther-Universität Halle-WittenbergHalleGermany

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-36574-5
  • Copyright Information Springer-Verlag Berlin Heidelberg 2003
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-00883-5
  • Online ISBN 978-3-540-36574-7
  • Series Print ISSN 0302-9743
  • About this book