- 19 - technische universität dortmund fakultät für informatik p. marwedel, informatik 12, 2012 Re-writing algorithms for memory hierarchies Analysis
{"Image DocumentName": "Re-writing algorithms for memory hierarchies", "Image ImageDescription": "Analysis of algorithm complexity mostly using the RAM (random access machine; constant memory access times) model outdated. \uf046 take memory hierarchies explicitly into account. Example: Usually, divide-&-conquer algorithms are good. Cache -oblivious algorithms (are good for any size of the faster memory and any block size). Assuming. Optimal replacement (Belady\u2019s algorithm) 2 Memory levels considered (there can be more) Full associativity. Automatic replacement. Unlikely to be ever automatic. [Piyush Kumar: Cache Oblivious Algorithms, in: U. Meyer et al. (eds.): Algorithms for Memory Hierarchies, Lecture Notes in Computer Science, Volume 2625, 2003, pp ] [Naila Rahman: Algorithms for Hardware Caches and TLB, in: U. Meyer et al. (eds.): Algorithms for Memory Hierarchies, Lecture Notes in Computer Science, Volume 2625, 2003, pp ] 19.", "Image XResolution": "37", "Image YResolution": "37", "Image ResolutionUnit": "Pixels/Centimeter", "Image Software": "SlidePlayer", "Image YCbCrPositioning": "Centered"}