Algorithms for Memory Hierarchies: Advanced Lectures
No Customer Reviews
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.
Format:Paperback
Language:English
ISBN:3540008837
ISBN13:9783540008835
Release Date:April 2003
Publisher:Springer
Length:429 Pages
Weight:1.32 lbs.
Dimensions:0.9" x 6.0" x 9.0"
Related Subjects
Algorithms Artificial Intelligence Computer Science Computers Computers & Technology Education & Reference Human Vision & Language Systems Medical Medical Books Modeling & Simulation Network Administration Networking Operating Systems Programming Software Design, Testing & Engineering Software Development Structured Design Theory of ComputingCustomer Reviews
0 rating
Copyright © 2025 Thriftbooks.com
Terms of Use | Privacy Policy | Do Not Sell/Share My Personal Information | Cookie Policy | Cookie Preferences | Accessibility Statement
ThriftBooks ® and the ThriftBooks ® logo are registered trademarks of Thrift Books Global, LLC
ThriftBooks ® and the ThriftBooks ® logo are registered trademarks of Thrift Books Global, LLC
