Leveraging Service Composition Relationship to Improve CPU Demand Estimation in SOA Environments

Chun Zhang, Rong N. Chang, Chang-Shing Perng, Edward So, Chunqiang Tang, Tao Tao
{"title":"Leveraging Service Composition Relationship to Improve CPU Demand Estimation in SOA Environments","authors":"Chun Zhang, Rong N. Chang, Chang-Shing Perng, Edward So, Chunqiang Tang, Tao Tao","doi":"10.1109/SCC.2008.135","DOIUrl":null,"url":null,"abstract":"Service oriented architecture (SOA) helps dynamically construct composite services out of a set of low-level atomic services to satisfy customer requirements. For the purpose of capacity planning and resource provisioning, it is important to understand these services' demand for system resources, e.g., CPU. In this paper, we propose a black-box method for estimating CPU demand of service requests based on linear regression between the observed request throughput and resource utilization level. A key advantage of our method is that its input data (i.e., request-processing throughput and resource utilization) can be easily obtained without intrusive software instrumentation. Moreover, we observe that, in an SOA environment, the service composition relationship (i.e., how low-level atomic services are connected into a composite service) is either known in advance or can be discovered through various means. We leverage this composition relationship to further improve the quality of CPU demand estimation. By analyzing the dependency between a composite service and its constituent low-level atomic services using linear algebra, our method can eliminate the collinear problem introduced by the service composition relationship. Moreover, our method can further reduce the number of unknown variables in the linear regression problem, and hence reduce the time duration needed to collect input data. In a dynamic SOA environment, this translates into faster response to changing workloads and more accurate estimation. We demonstrate these advantages of our method over a baseline method through extensive evaluation.","PeriodicalId":399213,"journal":{"name":"2008 IEEE International Conference on Services Computing","volume":"61 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 IEEE International Conference on Services Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCC.2008.135","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

Service oriented architecture (SOA) helps dynamically construct composite services out of a set of low-level atomic services to satisfy customer requirements. For the purpose of capacity planning and resource provisioning, it is important to understand these services' demand for system resources, e.g., CPU. In this paper, we propose a black-box method for estimating CPU demand of service requests based on linear regression between the observed request throughput and resource utilization level. A key advantage of our method is that its input data (i.e., request-processing throughput and resource utilization) can be easily obtained without intrusive software instrumentation. Moreover, we observe that, in an SOA environment, the service composition relationship (i.e., how low-level atomic services are connected into a composite service) is either known in advance or can be discovered through various means. We leverage this composition relationship to further improve the quality of CPU demand estimation. By analyzing the dependency between a composite service and its constituent low-level atomic services using linear algebra, our method can eliminate the collinear problem introduced by the service composition relationship. Moreover, our method can further reduce the number of unknown variables in the linear regression problem, and hence reduce the time duration needed to collect input data. In a dynamic SOA environment, this translates into faster response to changing workloads and more accurate estimation. We demonstrate these advantages of our method over a baseline method through extensive evaluation.
利用服务组合关系改进SOA环境中的CPU需求估计
面向服务的体系结构(SOA)有助于从一组低级原子服务中动态构造组合服务,以满足客户需求。为了进行容量规划和资源供应,了解这些服务对系统资源(例如CPU)的需求非常重要。在本文中,我们提出了一种基于观察到的请求吞吐量和资源利用水平之间的线性回归的黑盒方法来估计服务请求的CPU需求。我们的方法的一个关键优点是,它的输入数据(即,请求处理吞吐量和资源利用率)可以很容易地获得,而不需要侵入性的软件工具。此外,我们观察到,在SOA环境中,服务组合关系(即低级原子服务如何连接到组合服务中)要么是预先知道的,要么可以通过各种方式发现。我们利用这种组合关系来进一步提高CPU需求估计的质量。该方法通过使用线性代数分析组合服务与其组成的低级原子服务之间的依赖关系,消除了服务组合关系带来的共线问题。此外,我们的方法可以进一步减少线性回归问题中未知变量的数量,从而减少收集输入数据所需的时间。在动态SOA环境中,这意味着对不断变化的工作负载的更快响应和更准确的评估。我们通过广泛的评估证明了我们的方法优于基线方法的这些优点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信