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 mod...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Meyer, Ulrich (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Sanders, Peter (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Sibeyn, Jop (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2003.
Έκδοση:1st ed. 2003.
Σειρά:Lecture Notes in Computer Science, 2625
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 04211nam a2200601 4500
001 978-3-540-36574-7
003 DE-He213
005 20191022142128.0
007 cr nn 008mamaa
008 121227s2003 gw | s |||| 0|eng d
020 |a 9783540365747  |9 978-3-540-36574-7 
024 7 |a 10.1007/3-540-36574-5  |2 doi 
040 |d GrThAP 
050 4 |a TK7885-7895 
072 7 |a UY  |2 bicssc 
072 7 |a COM059000  |2 bisacsh 
072 7 |a UY  |2 thema 
082 0 4 |a 621.39  |2 23 
245 1 0 |a Algorithms for Memory Hierarchies  |h [electronic resource] :  |b Advanced Lectures /  |c edited by Ulrich Meyer, Peter Sanders, Jop Sibeyn. 
250 |a 1st ed. 2003. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2003. 
300 |a XV, 429 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 2625 
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. 
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 0 |a Computer engineering. 
650 0 |a Algorithms. 
650 0 |a Software engineering. 
650 0 |a Operating systems (Computers). 
650 0 |a Data structures (Computer science). 
650 1 4 |a Computer Engineering.  |0 http://scigraph.springernature.com/things/product-market-codes/I27000 
650 2 4 |a Algorithm Analysis and Problem Complexity.  |0 http://scigraph.springernature.com/things/product-market-codes/I16021 
650 2 4 |a Software Engineering.  |0 http://scigraph.springernature.com/things/product-market-codes/I14029 
650 2 4 |a Operating Systems.  |0 http://scigraph.springernature.com/things/product-market-codes/I14045 
650 2 4 |a Data Storage Representation.  |0 http://scigraph.springernature.com/things/product-market-codes/I15025 
650 2 4 |a Data Structures and Information Theory.  |0 http://scigraph.springernature.com/things/product-market-codes/I15009 
700 1 |a Meyer, Ulrich.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Sanders, Peter.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Sibeyn, Jop.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783540008835 
776 0 8 |i Printed edition:  |z 9783662190630 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 2625 
856 4 0 |u https://doi.org/10.1007/3-540-36574-5  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
912 |a ZDB-2-BAE 
950 |a Computer Science (Springer-11645)