Matches in Harvard for { <http://id.lib.harvard.edu/aleph/009168875/catalog> ?p ?o. }
Showing items 1 to 32 of
32
with 100 items per page.
- catalog abstract "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.".
- catalog contributor b12918980.
- catalog contributor b12918981.
- catalog contributor b12918982.
- catalog created "2003.".
- catalog date "2003".
- catalog date "2003.".
- catalog dateCopyrighted "2003.".
- catalog description "1. Memory Hierarchies -- Models and Lower Bounds / Peter Sanders -- 2. Basic External Memory Data Structures / Rasmus Pagh -- 3. A Survey of Techniques for Designing I/O-Efficient Algorithms / Anil Maheshwari and Norbert Zeh -- 4. Elementary Graph Algorithms in External Memory / Irit Katriel and Ulrich Meyer.".
- catalog description "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.".
- catalog description "Includes bibliographical references (p. [379]-420) and index.".
- catalog extent "xvii, 428 p. :".
- catalog identifier "3540008837 (softcover : alk. paper)".
- catalog isPartOf "Lecture notes in computer science ; 2625".
- catalog issued "2003".
- catalog issued "2003.".
- catalog language "eng".
- catalog publisher "Berlin ; New York : Springer,".
- catalog subject "005.1 21".
- catalog subject "Computational complexity.".
- catalog subject "Computer algorithms.".
- catalog subject "Computer files.".
- catalog subject "Computer science.".
- catalog subject "Computer software.".
- catalog subject "Data structures (Computer science)".
- catalog subject "Memory hierarchy (Computer science)".
- catalog subject "Operating systems (Computers).".
- catalog subject "QA76.9.A43 A435 2003".
- catalog subject "Software engineering.".
- catalog tableOfContents "1. Memory Hierarchies -- Models and Lower Bounds / Peter Sanders -- 2. Basic External Memory Data Structures / Rasmus Pagh -- 3. A Survey of Techniques for Designing I/O-Efficient Algorithms / Anil Maheshwari and Norbert Zeh -- 4. Elementary Graph Algorithms in External Memory / Irit Katriel and Ulrich Meyer.".
- catalog title "Algorithms for memory hierarchies : advanced lectures / Ulrich Meyer, Peter Sanders, Jop Sibeyn (eds.),".
- catalog type "text".