Algorithms for Memory Hierarchies Advanced Lectures /
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 mod...
Συγγραφή απο Οργανισμό/Αρχή: | SpringerLink (Online service) |
---|---|
Άλλοι συγγραφείς: | Meyer, Ulrich (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Sanders, Peter (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Sibeyn, Jop (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt) |
Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
Γλώσσα: | English |
Έκδοση: |
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
2003.
|
Έκδοση: | 1st ed. 2003. |
Σειρά: | Lecture Notes in Computer Science,
2625 |
Θέματα: | |
Διαθέσιμο Online: | Full Text via HEAL-Link |
Παρόμοια τεκμήρια
-
Algorithms - ESA 2003 11th Annual European Symposium, Budapest, Hungary, September 16-19, 2003, Proceedings /
Έκδοση: (2003) -
Generic Programming International Seminar on Generic Programming Dagstuhl Castle, Germany, April 27 - May 1, 1998, Selected Papers /
Έκδοση: (2000) -
Searchable Storage in Cloud Computing
ανά: Hua, Yu, κ.ά.
Έκδοση: (2019) -
Grid Computing - GRID 2002 Third International Workshop, Baltimore, MD, USA, November 18, 2002, Proceedings /
Έκδοση: (2002) -
String Processing and Information Retrieval 10th International Symposium, SPIRE 2003, Manaus, Brazil, October 8-10, 2003, Proceedings /
Έκδοση: (2003)