LEADER 04746nam 22007935 450 001 9910145911103321 005 20200705192943.0 010 $a3-540-36574-5 024 7 $a10.1007/3-540-36574-5 035 $a(CKB)1000000000016799 035 $a(SSID)ssj0000321222 035 $a(PQKBManifestationID)11246321 035 $a(PQKBTitleCode)TC0000321222 035 $a(PQKBWorkID)10263081 035 $a(PQKB)10886072 035 $a(DE-He213)978-3-540-36574-7 035 $a(MiAaPQ)EBC3073022 035 $a(PPN)155232282 035 $a(EXLCZ)991000000000016799 100 $a20121227d2003 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAlgorithms for Memory Hierarchies $eAdvanced Lectures /$fedited by Ulrich Meyer, Peter Sanders, Jop Sibeyn 205 $a1st ed. 2003. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2003. 215 $a1 online resource (XV, 429 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2625 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-00883-7 320 $aIncludes bibliographical references and index. 327 $aMemory 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. 330 $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. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2625 606 $aComputer engineering 606 $aAlgorithms 606 $aSoftware engineering 606 $aOperating systems (Computers) 606 $aData structures (Computer science) 606 $aComputer Engineering$3https://scigraph.springernature.com/ontologies/product-market-codes/I27000 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aSoftware Engineering$3https://scigraph.springernature.com/ontologies/product-market-codes/I14029 606 $aOperating Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I14045 606 $aData Storage Representation$3https://scigraph.springernature.com/ontologies/product-market-codes/I15025 606 $aData Structures and Information Theory$3https://scigraph.springernature.com/ontologies/product-market-codes/I15009 615 0$aComputer engineering. 615 0$aAlgorithms. 615 0$aSoftware engineering. 615 0$aOperating systems (Computers). 615 0$aData structures (Computer science). 615 14$aComputer Engineering. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aSoftware Engineering. 615 24$aOperating Systems. 615 24$aData Storage Representation. 615 24$aData Structures and Information Theory. 676 $a005.1 702 $aMeyer$b Ulrich$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aSanders$b Peter$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aSibeyn$b Jop$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910145911103321 996 $aAlgorithms for memory hierarchies$9953852 997 $aUNINA