Optimal Worst Case Formulas Comparing Cache Memory Associativity

DOI10.1137/S0097539798349164MaRDI QIDQ4507376zbMATH OpenOpenAlexFDO

Authors Håkan Lennerstad, Lars Lundberg

Publication date 18 October 2000

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539798349164

zbMATH Keywords

\(0,1\)-matricescache memorydirect-mapped cacheextremal matricesfully associative cacheperformance boundset-associative cache

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Extremal combinatorics (05D99) Mathematical problems of computer architecture (68M07) Combinatorics in computer science (68R05) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 1943112
• On the complexity of cache analysis for different replacement policies
• Optimal mapping in direct mapped cache environments
• An analysis of optimum caching
• scientific article; zbMATH DE number 1445384

Cited in

(7)

• Optimal mapping in direct mapped cache environments
• Hierarchical binary set partitioning in cache memories
• A MILP approach to DRAM access worst-case analysis
• scientific article; zbMATH DE number 1943112 (Why is no real title available?)
• scientific article; zbMATH DE number 1760016 (Why is no real title available?)
• On the Optimal Load-Memory Tradeoff of Cache-Aided Scalar Linear Function Retrieval
• On the complexity of cache analysis for different replacement policies

This page was built for publication: Optimal Worst Case Formulas Comparing Cache Memory Associativity

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