QM-ARC: QoS-aware Multi-tier Adaptive Cache Replacement Strategy

IF 6.2 2区 计算机科学 Q1 COMPUTER SCIENCE, THEORY & METHODS Future Generation Computer Systems-The International Journal of Escience Pub Date : 2024-10-03 DOI:10.1016/j.future.2024.107548
Lydia Ait-Oucheggou , Stéphane Rubini , Abdella Battou , Jalil Boukhobza
{"title":"QM-ARC: QoS-aware Multi-tier Adaptive Cache Replacement Strategy","authors":"Lydia Ait-Oucheggou ,&nbsp;Stéphane Rubini ,&nbsp;Abdella Battou ,&nbsp;Jalil Boukhobza","doi":"10.1016/j.future.2024.107548","DOIUrl":null,"url":null,"abstract":"<div><div>Distributed data-centric systems, such as Named Data Networking, utilize in-network caching to reduce application latency by buffering relevant data in high-speed memory. However, the significant increase in data traffic makes expanding memory capacity prohibitively expensive. To address this challenge, integrating technologies like non-volatile memory and high-speed solid-state drives with dynamic random-access memory can form a cost-effective multi-tier cache system. Additionally, most existing caching policies focus on categorizing data based on recency and frequency, overlooking the varying Quality-of-Service (QoS) requirements of applications and customers—a concept supported by Service Level Agreements in various service delivery models, particularly in Cloud computing. One of the most prominent algorithms in caching policy literature is the Adaptive Replacement Cache (ARC), that uses recency and frequency lists but does not account for QoS. In this paper, we propose a QoS-aware Multi-tier Adaptive Replacement Cache (QM-ARC) policy. QM-ARC extends ARC by incorporating QoS-based priorities between data applications and customers using a penalty concept borrowed from service-level management practices. QM-ARC is generic, applicable to any number of cache tiers, and can accommodate various penalty functions. Furthermore, we introduce a complementary feature for QM-ARC that employs Q-learning to dynamically adjust the sizes of the two ARC lists. Our solution, evaluated using both synthetic and real-world traces, demonstrates significant improvements in QoS compared to state-of-the-art methods by better considering priority levels. Results show that QM-ARC reduces penalties by up to 45% and increases the hit rate for high priority data by up to 84%, without negatively impacting the overall hit rate, which also increases by up to 61%.</div></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":null,"pages":null},"PeriodicalIF":6.2000,"publicationDate":"2024-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Future Generation Computer Systems-The International Journal of Escience","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0167739X24005120","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

Distributed data-centric systems, such as Named Data Networking, utilize in-network caching to reduce application latency by buffering relevant data in high-speed memory. However, the significant increase in data traffic makes expanding memory capacity prohibitively expensive. To address this challenge, integrating technologies like non-volatile memory and high-speed solid-state drives with dynamic random-access memory can form a cost-effective multi-tier cache system. Additionally, most existing caching policies focus on categorizing data based on recency and frequency, overlooking the varying Quality-of-Service (QoS) requirements of applications and customers—a concept supported by Service Level Agreements in various service delivery models, particularly in Cloud computing. One of the most prominent algorithms in caching policy literature is the Adaptive Replacement Cache (ARC), that uses recency and frequency lists but does not account for QoS. In this paper, we propose a QoS-aware Multi-tier Adaptive Replacement Cache (QM-ARC) policy. QM-ARC extends ARC by incorporating QoS-based priorities between data applications and customers using a penalty concept borrowed from service-level management practices. QM-ARC is generic, applicable to any number of cache tiers, and can accommodate various penalty functions. Furthermore, we introduce a complementary feature for QM-ARC that employs Q-learning to dynamically adjust the sizes of the two ARC lists. Our solution, evaluated using both synthetic and real-world traces, demonstrates significant improvements in QoS compared to state-of-the-art methods by better considering priority levels. Results show that QM-ARC reduces penalties by up to 45% and increases the hit rate for high priority data by up to 84%, without negatively impacting the overall hit rate, which also increases by up to 61%.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
QM-ARC:QoS 感知多层自适应缓存替换策略
以数据为中心的分布式系统(如命名数据网络)利用网络内缓存,通过在高速内存中缓冲相关数据来减少应用延迟。然而,数据流量的大幅增加使得扩大内存容量的成本过高。为了应对这一挑战,将非易失性内存和高速固态硬盘等技术与动态随机存取内存整合在一起,可以形成一个经济高效的多层缓存系统。此外,现有的大多数高速缓存策略都侧重于根据频繁程度和频率对数据进行分类,忽略了应用程序和客户对服务质量(QoS)的不同要求--在各种服务交付模式中,特别是在云计算中,服务水平协议支持这一概念。缓存策略文献中最著名的算法之一是自适应替换缓存(ARC),该算法使用周期和频率列表,但不考虑服务质量。在本文中,我们提出了一种服务质量感知多层自适应替换缓存(QM-ARC)策略。QM-ARC 扩展了 ARC,利用从服务级管理实践中借鉴的惩罚概念,在数据应用和客户之间纳入了基于 QoS 的优先级。QM-ARC 具有通用性,适用于任意数量的缓存层,并能适应各种惩罚函数。此外,我们还为 QM-ARC 引入了一项补充功能,即利用 Q-learning 来动态调整两个 ARC 列表的大小。我们的解决方案使用合成和实际跟踪进行评估,与最先进的方法相比,通过更好地考虑优先级,在 QoS 方面取得了显著改善。结果表明,QM-ARC 减少了高达 45% 的惩罚,并将高优先级数据的命中率提高了高达 84%,而不会对总体命中率产生负面影响,总体命中率也提高了高达 61%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
19.90
自引率
2.70%
发文量
376
审稿时长
10.6 months
期刊介绍: Computing infrastructures and systems are constantly evolving, resulting in increasingly complex and collaborative scientific applications. To cope with these advancements, there is a growing need for collaborative tools that can effectively map, control, and execute these applications. Furthermore, with the explosion of Big Data, there is a requirement for innovative methods and infrastructures to collect, analyze, and derive meaningful insights from the vast amount of data generated. This necessitates the integration of computational and storage capabilities, databases, sensors, and human collaboration. Future Generation Computer Systems aims to pioneer advancements in distributed systems, collaborative environments, high-performance computing, and Big Data analytics. It strives to stay at the forefront of developments in grids, clouds, and the Internet of Things (IoT) to effectively address the challenges posed by these wide-area, fully distributed sensing and computing systems.
期刊最新文献
SWIM: Sliding-Window Model contrast for federated learning Heterogeneous system list scheduling algorithm based on improved optimistic cost matrix The Fast Inertial ADMM optimization framework for distributed machine learning Review of deep learning-based pathological image classification: From task-specific models to foundation models Learning protein language contrastive models with multi-knowledge representation
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1