Algorithms for Memory Hierarchies : Advanced Lectures
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 mode...
Guardat en:
| Altres autors: | , , |
|---|---|
| Format: | Livre numérique |
| Idioma: | Anglais |
| Publicat: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Col·lecció: | Lecture notes in computer science
2625 |
| Matèries: | |
| Accés en línia: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Algorithms for memory hierarchies, advanced lectures, Ulrich Meyer, Peter Sanders, Jop Sibeyn (eds.), Berlin, Springer, 2003, 1 vol. (XVII-428 p.), Lecture notes in computer science, 3-540-00883-7 • Algorithms for Memory Hierarchies, Texte imprimé, 9783662190630 |
| LEADER | 04021nam a22004577a 4500 | ||
|---|---|---|---|
| 001 | 972928 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155232282 | ||
| 020 | |a 9783540365747 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004 | ||
| 082 | |a 005.1 | ||
| 245 | 0 | 0 | |a Algorithms for Memory Hierarchies : |b Advanced Lectures |c edited by Ulrich Meyer, Peter Sanders, Jop Sibeyn. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 2625 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a Memory Hierarchies Models and Lower Bounds -- Basic External Memory Data Structures -- A Survey of Techniques for Designing I/O-Efficient Algorithms -- Elementary Graph Algorithms in External Memory -- I/O-Efficient Algorithms for Sparse Graphs -- External Memory Computational Geometry Revisited -- Full-Text Indexes in External Memory -- Algorithms for Hardware Caches and TLB -- Cache Oblivious Algorithms -- An Overview of Cache Optimization Techniques and Cache-Aware Numerical Algorithms -- Memory Limitations in Artificial Intelligence -- Algorithmic Approaches for Storage Networks -- An Overview of File System Architectures -- Exploitation of the Memory Hierarchy in Relational DBMSs -- Hierarchical Models and Software Tools for Parallel Programming -- Case Study: Memory Conscious Parallel Sorting. | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 520 | |a 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. | ||
| 650 | |a Génie logiciel | ||
| 650 | |a Informatique | ||
| 650 | |a Algorithmes | ||
| 650 | |a Systèmes d'exploitation (ordinateurs) | ||
| 650 | |a Structures de données (informatique) | ||
| 650 | |a Hiérarchie de mémoire (informatique) | ||
| 650 | |a Ordinateurs |x Mémoires | ||
| 650 | |a Fichiers (informatique) |x Organisation | ||
| 700 | 1 | |a Sibeyn, Jop. |4 pbd | |
| 700 | 1 | |a Sanders, Peter, |d 1967- |4 pbd | |
| 700 | 1 | |a Meyer, Ulrich, |d 1971- |4 pbd | |
| 776 | 0 | |0 071176837 |t Algorithms for memory hierarchies |o advanced lectures |f Ulrich Meyer, Peter Sanders, Jop Sibeyn (eds.) |c Berlin |n Springer |d 2003 |p 1 vol. (XVII-428 p.) |s Lecture notes in computer science |z 3-540-00883-7 | |
| 776 | 0 | |t Algorithms for Memory Hierarchies |b Texte imprimé |z 9783662190630 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/3-540-36574-5 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-5KT4BFJX-0 |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:75063149X |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-36574-5 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:753988046 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-36574-5 |z Accès INSA CVL | |
| 997 | |0 972928 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||