An O (log k )-Competitive Algorithm for Generalized Caching

Author:

Adamaszek Anna1,Czumaj Artur2,Englert Matthias2,Räcke Harald3

Affiliation:

1. University of Copenhagen, Denmark

2. University of Warwick, UK

3. Technical University Munich, Germany

Abstract

In the generalized caching problem, we have a set of pages and a cache of size k . Each page p has a size w p ≥ 1 and fetching cost c p for loading the page into the cache. At any point in time, the sum of the sizes of the pages stored in the cache cannot exceed k . The input consists of a sequence of page requests. If a page is not present in the cache at the time it is requested, it has to be loaded into the cache, incurring a cost of c p . We give a randomized O (log k )-competitive online algorithm for the generalized caching problem, improving the previous bound of O (log 2 k ) by Bansal, Buchbinder, and Naor (STOC’08). This improved bound is tight and of the same order as the known bounds for the classic paging problem with uniform weights and sizes. We use the same LP-based techniques as Bansal et al. but provide improved and slightly simplified methods for rounding fractional solutions online.

Funder

Engineering and Physical Sciences Research Council

Publisher

Association for Computing Machinery (ACM)

Subject

Mathematics (miscellaneous)

Cited by 4 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Two-level Graph Caching for Expediting Distributed GNN Training;IEEE INFOCOM 2023 - IEEE Conference on Computer Communications;2023-05-17

2. Competitive Algorithms for Block-Aware Caching;Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures;2022-07-11

3. Online File Caching in Latency-Sensitive Systems with Delayed Hits and Bypassing;IEEE INFOCOM 2022 - IEEE Conference on Computer Communications;2022-05-02

4. Efficient Online Weighted Multi-Level Paging;Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures;2021-07-06

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3