Optimal management of dynamic buffer caches

DOI10.1016/0166-5316(95)00028-3zbMATH Open0875.68194OpenAlexW1984094743MaRDI QIDQ3122385FDOQ3122385

Authors: Andrew Choi, Manfred Ruschitzka 

Publication date: 27 February 1997

Published in: Performance Evaluation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-5316(95)00028-3

Recommendations

• An accurate and practical buffer allocation model for the buffer cache based on marginal gains.
• On adequate performance measures for paging
• Memory management for B-trees
• On paging with locality of reference
• An analytical study of strategy-oriented restructuring algorithms

zbMATH Keywords

Performance measuresCache memoriesLocality-set sequencesMemory management modelsPrepagingRealizable optimal policiesReference behaviorVMIN strategy

Mathematics Subject Classification ID

Computer system organization (68M99)

Cited In (8)

• An accurate and practical buffer allocation model for the buffer cache based on marginal gains.
• Management of partially safe buffers
• Title not available (Why is that?)
• BEAST: A Buffer Replacement Algorithm Using Spatial and Temporal Locality
• Dynamic buffering
• DIG: Degree of inter-reference gap for a dynamic buffer cache management
• Flexible and adaptable buffer management techniques for database management systems
• Nearly optimal FIFO buffer management for DiffServ

This page was built for publication: Optimal management of dynamic buffer caches

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