scientific article; zbMATH DE number 1303543

MaRDI QIDQ4250167zbMATH OpenFDO

Authors J. Noga, Marek Chrobak

Publication date 17 June 1999

zbMATH Keywords

paging problem

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07)

Recommendations

• LRU is better than FIFO
• Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis
• Quantifying competitiveness in paging with locality of reference
• Competitive paging with locality of reference

Cited in

(10)

• LRU is better than FIFO
• Quantifying competitiveness in paging with locality of reference
• Relative interval analysis of paging algorithms on access graphs
• Relative interval analysis of paging algorithms on access graphs
• Quantifying competitiveness in paging with locality of reference
• LRU is better than FIFO under the independent reference model
• Theoretical Evidence for the Superiority of LRU-2 over LRU for the Paging Problem
• Algorithms – ESA 2004
• On paging with locality of reference
• A theoretical comparison of LRU and LRU-K

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 Q4250167)