Vyhledávat v databázi titulů je možné dle ISBN, ISSN, EAN, č. ČNB, OCLC či vlastního identifikátoru. Vyhledávat lze i v databázi autorů dle id autority či jména.
Projekt ObalkyKnih.cz sdružuje různé zdroje informací o knížkách do jedné, snadno použitelné webové služby. Naše databáze v tuto chvíli obsahuje 3152128 obálek a 950683 obsahů českých a zahraničních publikací. Naše API využívá většina knihoven v ČR.
Algorithms for Memory Hierarchies: Advanced Lectures (Lecture Notes in Computer Science)
Autor: Meyer, Ulrich.
Rok: 2003
ISBN: 9783540008835
OKCZID: 110078967
Citace (dle ČSN ISO 690):
MEYER, Ulrich, ed., SANDERS, Peter, ed. a SIBEYN, Jop, ed. Algorithms for memory hierarchies: advanced lectures. Berlin: Springer, c2003. XVII, 428 s. Lecture notes in computer science, 2625.
Anotace
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.