基于吞吐量的实时验证,用于监控大批量并行进程

X. Liu, Dingxian Wang, Dong Yuan, Futian Wang, Yun Yang
{"title":"基于吞吐量的实时验证,用于监控大批量并行进程","authors":"X. Liu, Dingxian Wang, Dong Yuan, Futian Wang, Yun Yang","doi":"10.1145/2600821.2600834","DOIUrl":null,"url":null,"abstract":"On-time completion is one of the most important QoS (Quality of Service) dimensions for business processes running in the cloud. While today’s business systems often need to handle thousands of concurrent user requests, process monitoring is basically conducted in a one by one fashion. It is possible to repeat the strategies for monitoring a single process a thousand times to monitor a thousand parallel processes. However, the time overhead will be a thousand-fold increase as well, which brings a big challenge for process monitoring. In this paper, based on a novel runtime throughput consistency model, we propose a QoS-aware throughput based checkpoint selection strategy which can dynamically select a small number of checkpoints along the system timeline to facilitate the temporal verification of throughput constraints and achieve the target on-time completion rate. The experimental results demonstrate that our strategy can achieve the best efficiency and effectiveness compared with the state-of-the-art as well as other representative response-time based checkpoint selection strategies.","PeriodicalId":296714,"journal":{"name":"International Conference on Software and Systems Process","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":"{\"title\":\"Throughput based temporal verification for monitoring large batch of parallel processes\",\"authors\":\"X. Liu, Dingxian Wang, Dong Yuan, Futian Wang, Yun Yang\",\"doi\":\"10.1145/2600821.2600834\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"On-time completion is one of the most important QoS (Quality of Service) dimensions for business processes running in the cloud. While today’s business systems often need to handle thousands of concurrent user requests, process monitoring is basically conducted in a one by one fashion. It is possible to repeat the strategies for monitoring a single process a thousand times to monitor a thousand parallel processes. However, the time overhead will be a thousand-fold increase as well, which brings a big challenge for process monitoring. In this paper, based on a novel runtime throughput consistency model, we propose a QoS-aware throughput based checkpoint selection strategy which can dynamically select a small number of checkpoints along the system timeline to facilitate the temporal verification of throughput constraints and achieve the target on-time completion rate. The experimental results demonstrate that our strategy can achieve the best efficiency and effectiveness compared with the state-of-the-art as well as other representative response-time based checkpoint selection strategies.\",\"PeriodicalId\":296714,\"journal\":{\"name\":\"International Conference on Software and Systems Process\",\"volume\":\"17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-05-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Software and Systems Process\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2600821.2600834\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Software and Systems Process","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2600821.2600834","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16

摘要

准时完成是在云中运行的业务流程的最重要的QoS(服务质量)维度之一。虽然当今的业务系统通常需要处理数千个并发用户请求,但流程监控基本上是以逐个方式进行的。可以将监视单个流程的策略重复一千次,以监视一千个并行流程。然而,时间开销也将增加一千倍,这给过程监控带来了很大的挑战。本文基于一种新颖的运行时吞吐量一致性模型,提出了一种基于qos感知吞吐量的检查点选择策略,该策略可以沿着系统时间线动态选择少量检查点,以方便对吞吐量约束进行时间验证,从而实现目标准时完成率。实验结果表明,与最先进的以及其他具有代表性的基于响应时间的检查点选择策略相比,我们的策略可以达到最佳的效率和有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Throughput based temporal verification for monitoring large batch of parallel processes
On-time completion is one of the most important QoS (Quality of Service) dimensions for business processes running in the cloud. While today’s business systems often need to handle thousands of concurrent user requests, process monitoring is basically conducted in a one by one fashion. It is possible to repeat the strategies for monitoring a single process a thousand times to monitor a thousand parallel processes. However, the time overhead will be a thousand-fold increase as well, which brings a big challenge for process monitoring. In this paper, based on a novel runtime throughput consistency model, we propose a QoS-aware throughput based checkpoint selection strategy which can dynamically select a small number of checkpoints along the system timeline to facilitate the temporal verification of throughput constraints and achieve the target on-time completion rate. The experimental results demonstrate that our strategy can achieve the best efficiency and effectiveness compared with the state-of-the-art as well as other representative response-time based checkpoint selection strategies.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信