Online file caching with rejection penalties

DOI10.1007/s00453-013-9793-0zbMath1315.68289OpenAlexW1981984261MaRDI QIDQ2346958

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

Publication date: 26 May 2015

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-013-9793-0

zbMATH Keywords

online algorithmspagingcaching

Mathematics Subject Classification ID

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

Related Items (2)

Dynamic Balanced Graph Partitioning ⋮ Competitive clustering of stochastic communication patterns on a ring

Uses Software

• OnlineMin

Cites Work

• Unnamed Item
• Unnamed Item
• New nonparametric tests for testing homogeneity of scale parameters against umbrella alternative
• Graph coloring with rejection
• Caching is hard -- even in the fault model
• 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 companion caching
• Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost
• Online scheduling with machine cost and rejection
• On-line restricted caching
• Bin packing problems with rejection penalties and their dual problems
• OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm
• Randomized Competitive Algorithms for Generalized Caching
• New Ressults on Server Problems
• Competitive algorithms for server problems
• Equitable Revisited
• Competitive paging algorithms
• A General Approximation Technique for Constrained Forest Problems
• Competitive Algorithms for Relaxed List Update and Multilevel Caching
• 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
• New results on web caching with request reordering

This page was built for publication: Online file caching with rejection penalties