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...
Sparad:
| Övriga upphovsmän: | , , |
|---|---|
| Materialtyp: | Livre numérique |
| Språk: | Anglais |
| Publicerad: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serie: | Lecture notes in computer science
2625 |
| Ämnen: | |
| Länkar: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Anmärkning: |
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 |