Leveraging Queueing Theory and OS Profiling to Reduce Application Latency

Anshul Gandhi, Amoghavarsha Suresh
{"title":"Leveraging Queueing Theory and OS Profiling to Reduce Application Latency","authors":"Anshul Gandhi, Amoghavarsha Suresh","doi":"10.1145/3366625.3368853","DOIUrl":null,"url":null,"abstract":"Request latency is a critical metric in determining the usability of online services, such as web applications and databases. Most existing approaches to improve application latency start by detecting bottlenecks in the application deployment; this typically entails determining stages of processing where the application spends most of its time. Inspired by queueing theory, we present an alternative approach to detect and mitigate bottlenecks âĂrŞ using variability of processing time as a guiding principle when designing applications.","PeriodicalId":155490,"journal":{"name":"Proceedings of the 20th International Middleware Conference Tutorials","volume":"248 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 20th International Middleware Conference Tutorials","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3366625.3368853","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Request latency is a critical metric in determining the usability of online services, such as web applications and databases. Most existing approaches to improve application latency start by detecting bottlenecks in the application deployment; this typically entails determining stages of processing where the application spends most of its time. Inspired by queueing theory, we present an alternative approach to detect and mitigate bottlenecks âĂrŞ using variability of processing time as a guiding principle when designing applications.
利用排队理论和操作系统分析来减少应用程序延迟
请求延迟是确定在线服务(如web应用程序和数据库)可用性的关键指标。大多数现有的改进应用程序延迟的方法都是从检测应用程序部署中的瓶颈开始的;这通常需要确定应用程序花费大部分时间的处理阶段。受排队理论的启发,我们提出了一种检测和缓解瓶颈的替代方法âĂrŞ,在设计应用程序时使用处理时间的可变性作为指导原则。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信