Item description for Algorithms for Memory Hierarchies: Advanced Lectures (Lecture Notes in Computer Science) by Ulrich Meyer, Peter Sanders, Jop Sibeyn, Jop Sibeyn, Clem Robins, Jon Tyson & Sylvia Yount...
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.
Promise Angels is dedicated to bringing you great books at great prices. Whether you read for entertainment, to learn, or for literacy - you will find what you want at promiseangels.com!
Est. Packaging Dimensions: Length: 1" Width: 6.25" Height: 9" Weight: 1.6 lbs.
Release Date Aug 1, 2003
ISBN 3540008837 ISBN13 9783540008835
Availability 0 units.
More About Ulrich Meyer, Peter Sanders, Jop Sibeyn, Jop Sibeyn, Clem Robins, Jon Tyson & Sylvia Yount
Meyer, a respected German Bach scholar, has contributed many articles to such journals as Musik und Kirche and Bach-Jahrbuch, and is founding member of the arbeitsgemeinschaft fur theologische Bachforschung.