ALGORITHMS FOR MEMORY HIERARCHIES by Ulrich Meyer (Editor), Peter Sanders (Editor), Jop Sibeyn (Editor) ( 9783540008835 )

Item Details

Title:

ALGORITHMS FOR MEMORY HIERARCHIES
ADVANCED LECTURES

By:

Ulrich Meyer (Editor), Peter Sanders (Editor), Jop Sibeyn (Editor)

Format:

Paperback

List price:	£62.99
We currently do not stock this item, please contact the publisher directly for further information.

ISBN 10:

3540008837

ISBN 13:

9783540008835

Publisher:

SPRINGER-VERLAG BERLIN AND HEIDELBERG GMBH & CO. KG

Pub. date:

7 April, 2003

Edition:

2003 ed.

Series:

Lecture Notes in Computer Science 2625

Pages:

429

Synopsis:

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.

Illustrations:

XV, 429 p.

Publication:

Germany

Imprint:

Springer-Verlag Berlin and Heidelberg GmbH & Co. K

Returns:

Returnable

Some other items by this author:

ALGORITHM ENGINEERING (PB)

ALGORITHMEN UND DATENSTRUKTUREN

ALGORITHMS (PB)