scientific article; zbMATH DE number 1305454

MaRDI QIDQ4252340zbMATH OpenFDO

Authors James D. Fix, Anthony LaMarca, Richard E. Ladner

Publication date 17 June 1999

zbMATH Keywords

cache performance of algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 1943112
• scientific article; zbMATH DE number 2079386
• Towards a theory of cache-efficient algorithms
• scientific article; zbMATH DE number 1445384
• An analysis of optimum caching

Cited in

(9)

• Optimal mapping in direct mapped cache environments
• On the analysis of random replacement caches using static probabilistic timing methods for multi-path programs
• Entropy representation of memory access characteristics and cache performance
• scientific article; zbMATH DE number 1943112 (Why is no real title available?)
• Efficient stack simulation for set-associative virtual address caches with real tags
• A comparison of trace-sampling techniques for multi-megabyte caches
• scientific article; zbMATH DE number 2079386 (Why is no real title available?)
• A blocked all-pairs shortest-paths algorithm
• The cost of cache-oblivious searching

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4252340)