Algorithms for Memory Hierarchies / Lecture Notes in Computer Science Bd.2625 (PDF)
...
- Kreditkarte, Paypal, Rechnung
- Kostenloser tolino webreader
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.
- 2003, 2003, 429 Seiten, Englisch
- Herausgegeben: Ulrich Meyer, Peter Sanders, Jop Sibeyn
- Verlag: Springer Berlin Heidelberg
- ISBN-10: 3540365745
- ISBN-13: 9783540365747
- Erscheinungsdatum: 01.07.2003
Abhängig von Bildschirmgrösse und eingestellter Schriftgrösse kann die Seitenzahl auf Ihrem Lesegerät variieren.
- Dateiformat: PDF
- Grösse: 4.62 MB
- Ohne Kopierschutz
- Vorlesefunktion
Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
---|
Schreiben Sie einen Kommentar zu "Algorithms for Memory Hierarchies / Lecture Notes in Computer Science Bd.2625".
Kommentar verfassen