Custom cover image
Custom cover image

Algorithms for Memory Hierarchies : Advanced Lectures / edited by Ulrich Meyer, Peter Sanders, Jop Sibeyn

Contributor(s): Resource type: Ressourcentyp: Buch (Online)Book (Online)Language: English Series: SpringerLink Bücher | Springer eBook Collection Computer Science | Lecture notes in computer science ; 2625Publisher: Berlin, Heidelberg : Springer-Verlag Berlin Heidelberg, 2003Description: Online-RessourceISBN:
  • 9783540365747
  • 3540008837
Subject(s): Genre/Form: Additional physical formats: 9783540008835 | Buchausg. u.d.T.: Algorithms for memory hierarchies. Berlin : Springer, 2003. XVII, 428 S.DDC classification:
  • 005.1
  • 621.39 23
  • 004.6 23
MSC: MSC: *68U99 | 68-06 | 68W99RVK: RVK: ST 134LOC classification:
  • QA76.9.A43
DOI: DOI: 10.1007/3-540-36574-5Online resources: Summary: 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 viewPPN: PPN: 1649191480Package identifier: Produktsigel: ZDB-2-BAE | ZDB-2-LNC | ZDB-2-SCS | ZDB-2-SXCS | ZDB-2-SEB
No physical items for this record
KIT – The University in the Helmholtz Association                         Home | Impressum | Datenschutz | Barrierefreiheit | KIT