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 mode
[Lecture Notes in Computer Science] Algorithms for Memory Hierarchies Volume 2625 || An Overview of Cache Optimization Techniques and Cache-Aware Numerical Algorithms
β Scribed by Meyer, Ulrich; Sanders, Peter; Sibeyn, Jop
- Book ID
- 120928019
- Publisher
- Springer Berlin Heidelberg
- Year
- 2003
- Weight
- 260 KB
- Category
- Article
- ISBN
- 3540365745
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The volume LNCS 7269 constitutes the refereed proceedings of the International Symposium on Swarm Intelligence and Differential Evolution, SIDE 2012, held in Zakopane, Poland, in April/May 2012 in conjunction with the 11th International Conference on Artificial Intelligence and Soft Computing, ICAIS
This Book Constitutes The Refereed Proceedings Of The 36th Conference On Current Trends In Theory And Practice Of Computer Science, Sofsem 2010, Held In Ε pindleruv MlΓ½n, Czech Republic, In January 2009. The 53 Revised Full Papers, Presented Together With 11 Invited Contributions, Were Carefully Revi
This volume in the Springer Lecture Notes in Computer Science (LNCS) series contains 98 papers presented at the S SSPR 2008 workshops. S SSPR 2008 was the sixth time that the SPR and SSPR workshops organized by Technical Committees, TC1 and TC2, of the International Association for Pattern Rec- niti