scientific article; zbMATH DE number 7053384

zbMath1422.68031MaRDI QIDQ5743508

Andrei Negoescu, Gabriel Moruz

Publication date: 10 May 2019

Full work available at URL: https://dl.acm.org/citation.cfm?id=2095248

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Theory of operating systems (68N25)

Related Items

Relative Worst-Order Analysis: A Survey, The optimal structure of algorithms for \(\alpha\)-paging, Engineering Efficient Paging Algorithms

Uses Software

• OnlineMin

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Knowledge state algorithms
• A strongly competitive randomized paging algorithm
• The relative worst-order ratio applied to paging
• Competitive snoopy caching
• A new measure for the study of on-line algorithms
• Competitive analysis of randomized paging algorithms
• Competitive paging with locality of reference
• OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm
• Parameterized Analysis of Paging and List Update Algorithms
• Competitive paging algorithms
• Beyond Competitive Analysis
• Flexible reference trace reduction for VM simulations
• Strongly Competitive Algorithms for Paging with Locality of Reference
• Paging and list update under bijective analysis
• The working set model for program behavior
• On paging with locality of reference