基于回归的副本选择算法减少Cassandra聚类的尾部延迟

Euclides Chauque, Ismail Arai, K. Fujikawa
{"title":"基于回归的副本选择算法减少Cassandra聚类的尾部延迟","authors":"Euclides Chauque, Ismail Arai, K. Fujikawa","doi":"10.1109/GCAIoT51063.2020.9345823","DOIUrl":null,"url":null,"abstract":"Online applications adoption, and success are driven by a multitude of factors among them the service response time. This is natural as users tend to prefer a faster service than a slower. However, it is challenging to deliver consistently fast response times due to performance variability inherent to the infrastructure running the application; This performance variability causes a fraction of user requests to experience unusual latency called tail latency. In this work, a Linear Regression Based Replica Selection Algorithm is proposed. The regression model helps to estimate how long a specific query is going to take to be serviced, and based on this information, a server with more or less resources is chosen to service the query. Experiments done using data generated by a fleet of buses show that the proposed approach is successful in reducing the higher percentiles latency up to 30 % in some cases while not impacting negatively the throughput.","PeriodicalId":398815,"journal":{"name":"2020 IEEE Global Conference on Artificial Intelligence and Internet of Things (GCAIoT)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Reducing Tail Latency In Cassandra Cluster Using Regression Based Replica Selection Algorithm\",\"authors\":\"Euclides Chauque, Ismail Arai, K. Fujikawa\",\"doi\":\"10.1109/GCAIoT51063.2020.9345823\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Online applications adoption, and success are driven by a multitude of factors among them the service response time. This is natural as users tend to prefer a faster service than a slower. However, it is challenging to deliver consistently fast response times due to performance variability inherent to the infrastructure running the application; This performance variability causes a fraction of user requests to experience unusual latency called tail latency. In this work, a Linear Regression Based Replica Selection Algorithm is proposed. The regression model helps to estimate how long a specific query is going to take to be serviced, and based on this information, a server with more or less resources is chosen to service the query. Experiments done using data generated by a fleet of buses show that the proposed approach is successful in reducing the higher percentiles latency up to 30 % in some cases while not impacting negatively the throughput.\",\"PeriodicalId\":398815,\"journal\":{\"name\":\"2020 IEEE Global Conference on Artificial Intelligence and Internet of Things (GCAIoT)\",\"volume\":\"21 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-12-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 IEEE Global Conference on Artificial Intelligence and Internet of Things (GCAIoT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GCAIoT51063.2020.9345823\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE Global Conference on Artificial Intelligence and Internet of Things (GCAIoT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GCAIoT51063.2020.9345823","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在线应用程序的采用和成功是由许多因素驱动的,其中包括服务响应时间。这是很自然的,因为用户往往喜欢更快的服务而不是更慢的服务。然而,由于运行应用程序的基础设施固有的性能可变性,交付一致的快速响应时间是具有挑战性的;这种性能变化导致一小部分用户请求经历不寻常的延迟,称为尾延迟。本文提出了一种基于线性回归的副本选择算法。回归模型有助于估计为特定查询提供服务所需的时间,并根据此信息选择具有或多或少资源的服务器来为查询提供服务。使用一组总线生成的数据进行的实验表明,所提出的方法在某些情况下成功地将较高百分位数的延迟降低了30%,同时不会对吞吐量产生负面影响。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Reducing Tail Latency In Cassandra Cluster Using Regression Based Replica Selection Algorithm
Online applications adoption, and success are driven by a multitude of factors among them the service response time. This is natural as users tend to prefer a faster service than a slower. However, it is challenging to deliver consistently fast response times due to performance variability inherent to the infrastructure running the application; This performance variability causes a fraction of user requests to experience unusual latency called tail latency. In this work, a Linear Regression Based Replica Selection Algorithm is proposed. The regression model helps to estimate how long a specific query is going to take to be serviced, and based on this information, a server with more or less resources is chosen to service the query. Experiments done using data generated by a fleet of buses show that the proposed approach is successful in reducing the higher percentiles latency up to 30 % in some cases while not impacting negatively the throughput.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信