On Variants of File Caching

DOI10.1007/978-3-642-22006-7_17zbMath1332.68044OpenAlexW132165771MaRDI QIDQ3012805

Leah Epstein, Asaf Levin, Csanád Imreh, Judit Nagy-György

Publication date: 6 July 2011

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22006-7_17

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Online algorithms; streaming algorithms (68W27)

Related Items (1)

Dynamic Balanced Graph Partitioning

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph coloring with rejection
• A strongly competitive randomized paging algorithm
• Bin packing with rejection revisited
• Competitive snoopy caching
• Caching documents with variable sizes and fetching costs: an LP-based approach
• Competitive analysis of randomized paging algorithms
• On-line file caching
• Page replacement with multi-size pages and applications to web caching
• On-line scheduling of unit time jobs with rejection: Minimizing the total completion time
• Online scheduling with machine cost and rejection
• Bin packing problems with rejection penalties and their dual problems
• New Ressults on Server Problems
• Competitive algorithms for server problems
• Caching Is Hard – Even in the Fault Model
• Competitive paging algorithms
• A General Approximation Technique for Constrained Forest Problems
• Multiprocessor Scheduling with Rejection
• A Primal-Dual Randomized Algorithm for Weighted Paging
• A unified approach to approximating resource allocation and scheduling
• Preemptive multiprocessor scheduling with rejection

This page was built for publication: On Variants of File Caching