Measuring cache and TLB performance and their effect on benchmark runtimes

DOI10.1109/12.467697MaRDI QIDQ4421171zbMATHOpenAlexFDO

Authors Rafael H. Saavedra, Alan J. Smith

Publication date 1995

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/d17641ebe78dc79fe5ebb4e901da501e3f99d080

zbMATH Keywords

performance evaluationmemory hierarchyexecution time predictionprocessor cachestable lookaside buffers

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computer system organization (68M99)

Recommendations

• scientific article; zbMATH DE number 1943112
• scientific article; zbMATH DE number 1728433
• The susceptibility of programs to context switching
• Workload characterization of emerging computer applications
• Towards a theory of cache-efficient algorithms

Cited in

(9)

• A complexity O(1) priority queue for event driven molecular dynamics simulations
• Performance evaluation of a decoded instruction cache for variable instruction length computers
• The susceptibility of programs to context switching
• scientific article; zbMATH DE number 1760107 (Why is no real title available?)
• scientific article; zbMATH DE number 2080890 (Why is no real title available?)
• An efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems
• Architecture technique trade-offs using mean memory delay time
• Workload characterization of emerging computer applications
• scientific article; zbMATH DE number 1728433 (Why is no real title available?)

This page was built for publication: Measuring cache and TLB performance and their effect on benchmark runtimes

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