A MILP approach to DRAM access worst-case analysis

DOI10.1016/J.COR.2022.105774MaRDI QIDQ2147044zbMATH OpenOpenAlexFDO

Authors Matteo Andreozzi, Antonio Frangioni, Laura Galli, Giovanni Stea, Raffaele Zippo

Publication date 22 June 2022

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2022.105774

zbMATH Keywords

schedulingmixed integer linear programmingworst-case analysisnetwork-calculus

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• Optimal Worst Case Formulas Comparing Cache Memory Associativity
• Dynamic programming in faulty memory hierarchies (cache-obliviously)
• Formal Analysis of Memory Contention in a Multiprocessor System
• Distributed order scheduling and its application to multi-core DRAM controllers
• Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis
• Minimizing Access Cost for Multiple Types of Memory Units in Embedded Systems Through Data Allocation and Scheduling

Cites work

• Network calculus. A theory of deterministic queueing systems for the Internet

Cited in

(3)

• Memory controllers for mixed-time-criticality systems. Architectures, methodologies and trade-offs
• RowHammer and beyond
• scientific article; zbMATH DE number 1753942 (Why is no real title available?)

This page was built for publication: A MILP approach to DRAM access worst-case analysis

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