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.
Algorithms for Memory Hierarchies: Advanced Lectures
and over one million other books are available for Amazon Kindle.
Learn more
FREE Two-Day Shipping for students on millions of items. Learn more |
| |||||||||||||||
Book Description
Special Offers and Product Promotions
- Buy $50 in qualifying physical textbooks, get $5 in Amazon MP3 Credit. Here's how (restrictions apply)
Product Details
Would you like to update product info or give feedback on images?
|
Customer Reviews
|
There are no customer reviews yet.
|
|||
|
Video reviews
|
Inside This Book
(learn more)
First Sentence:
There are too many possible developments to explain or even perceive all of them in detail but a few basic trends should be noted. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
middle subsegments, internal memory setting, lexicographic naming, internal memory algorithm, routing rectangles, run formation phase, coordinated caching, next page fault, right subsegments, external segment tree, multislab lists, external memory model, external memory algorithms, separator algorithm, hash teams, separator vertices, segment intersection problem, predecessor dictionary, external memory setting, external memory data structures, balance invariant, halfspace range searching, plain implementation, range searching problem, counter matrix Key Phrases - Capitalized Phrases (CAPs): (learn more)
Hash Join, Nested Loop Join, Springer-Verlag Berlin Heidelberg, Buffer Manager, Horizontal Partitioning, Index Scan, Run Generation, Merge Join, Segment Stabbing, Hash Teams, Peter Sanders, Vertical Partitioning, Pointer Elimination, Segment Sorting, Intel Itanium, Cache Memory Model, Element Uniqueness, Exploitation of the Memory Hierarchy, Halfspace Intersection, Intel Xeon, Internal Memory Model, Planar Point Location, Short Pat New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
There are too many possible developments to explain or even perceive all of them in detail but a few basic trends should be noted. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
middle subsegments, internal memory setting, lexicographic naming, internal memory algorithm, routing rectangles, run formation phase, coordinated caching, next page fault, right subsegments, external segment tree, multislab lists, external memory model, external memory algorithms, separator algorithm, hash teams, separator vertices, segment intersection problem, predecessor dictionary, external memory setting, external memory data structures, balance invariant, halfspace range searching, plain implementation, range searching problem, counter matrix Key Phrases - Capitalized Phrases (CAPs): (learn more)
Hash Join, Nested Loop Join, Springer-Verlag Berlin Heidelberg, Buffer Manager, Horizontal Partitioning, Index Scan, Run Generation, Merge Join, Segment Stabbing, Hash Teams, Peter Sanders, Vertical Partitioning, Pointer Elimination, Segment Sorting, Intel Itanium, Cache Memory Model, Element Uniqueness, Exploitation of the Memory Hierarchy, Halfspace Intersection, Intel Xeon, Internal Memory Model, Planar Point Location, Short Pat New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Citations (learn more)
This book cites 62
books:
See all 62 books this book cites
- Artificl Intell Instructrs Manual Tx by Author Unknown in Back Matter (1), Back Matter (2), and Back Matter (3)
- Computer Science by R Baeza-Yates in Back Matter (1), and Back Matter (2)
- Computational Geometry: Algorithms and Applications, Second Edition by Mark de Berg in Back Matter (1), and Back Matter (2)
- Handbook of Computational Geometry by J.R. Sack in Back Matter (1), and Back Matter (2)
- Data Structures: WITH JBuilder 3.5 Compiler by Michael T. Goodrich in Back Matter (1), and Back Matter (2)
See all 62 books this book cites
Books on Related Topics
(learn more)
|
What Other Items Do Customers Buy After Viewing This Item?
Tag this product(What's this?)Think of a tag as a keyword or label you consider is strongly related to this product.
Tags will help all customers organize and find favorite items. |
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
Listmania!
So You'd Like to...
Look for Similar Items by Category
- Books > Computers & Technology > Computer Science > Artificial Intelligence > Theory of Computing
- Books > Computers & Technology > Computer Science > Modeling & Simulation
- Books > Computers & Technology > Networking > Network Administration
- Books > Computers & Technology > Operating Systems
- Books > Computers & Technology > Programming > Algorithms
- Books > Computers & Technology > Programming > Software Design, Testing & Engineering > Software Development
- Books > Medical Books
- Books > New & Used Textbooks > Computer Science > Algorithms
- Books > New & Used Textbooks > Computer Science > Artificial Intelligence
- Books > New & Used Textbooks > Computer Science > Operating Systems
- Books > New & Used Textbooks > Computer Science > Software Design & Engineering
- Books > New & Used Textbooks > Medicine & Health Sciences > Medicine > General
