云服务模式的数值解

V. Georgiev
{"title":"云服务模式的数值解","authors":"V. Georgiev","doi":"10.1109/MCSI.2014.49","DOIUrl":null,"url":null,"abstract":"This paper presents a method for numerical solution of Markov-chain based models of dynamic load balancing schemes for cloud clusters. These schemes were presented in detail in earlier publications. Here we are describing the fast converging iterative solution of a class of such models. The numerical solution of the dynamic load-balancing models by computer solvers proved to be problematic if not applicable due to its computational instability. Other numerical methods available for solving Markov chains relay on constant transition rates or at least on rates that are not depending on the state probabilities. The proposed method combines analytical approach with the simple computations based on electronic tables and gives a solution in just a few iteration steps. It is designed especially for Markov chains in which transition rates are functions of the steady-state probabilities -- and that is the case of most dynamic load balancing schemes. The simplicity of this numerical method allows to compute the parameters for vast modeling space thus providing a broad picture of cloud servers' performance.","PeriodicalId":202841,"journal":{"name":"2014 International Conference on Mathematics and Computers in Sciences and in Industry","volume":"60 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Numerical Solution of Cloud Servicing Models\",\"authors\":\"V. Georgiev\",\"doi\":\"10.1109/MCSI.2014.49\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a method for numerical solution of Markov-chain based models of dynamic load balancing schemes for cloud clusters. These schemes were presented in detail in earlier publications. Here we are describing the fast converging iterative solution of a class of such models. The numerical solution of the dynamic load-balancing models by computer solvers proved to be problematic if not applicable due to its computational instability. Other numerical methods available for solving Markov chains relay on constant transition rates or at least on rates that are not depending on the state probabilities. The proposed method combines analytical approach with the simple computations based on electronic tables and gives a solution in just a few iteration steps. It is designed especially for Markov chains in which transition rates are functions of the steady-state probabilities -- and that is the case of most dynamic load balancing schemes. The simplicity of this numerical method allows to compute the parameters for vast modeling space thus providing a broad picture of cloud servers' performance.\",\"PeriodicalId\":202841,\"journal\":{\"name\":\"2014 International Conference on Mathematics and Computers in Sciences and in Industry\",\"volume\":\"60 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-09-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 International Conference on Mathematics and Computers in Sciences and in Industry\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MCSI.2014.49\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 International Conference on Mathematics and Computers in Sciences and in Industry","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MCSI.2014.49","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

本文提出了一种基于马尔可夫链的云集群动态负载均衡模型的数值求解方法。这些方案在以前的出版物中有详细的介绍。这里我们描述了一类这样的模型的快速收敛迭代解。由于计算的不稳定性,用计算机求解动态负载平衡模型的数值解是有问题的。其他可用于求解马尔可夫链的数值方法依赖于恒定的转移速率,或者至少依赖于不依赖于状态概率的速率。该方法将解析法与基于电子表的简单计算相结合,只需几个迭代步骤即可求解。它是专门为马尔可夫链设计的,其中转移率是稳态概率的函数——这是大多数动态负载平衡方案的情况。这种数值方法的简单性允许为巨大的建模空间计算参数,从而提供云服务器性能的广泛图像。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Numerical Solution of Cloud Servicing Models
This paper presents a method for numerical solution of Markov-chain based models of dynamic load balancing schemes for cloud clusters. These schemes were presented in detail in earlier publications. Here we are describing the fast converging iterative solution of a class of such models. The numerical solution of the dynamic load-balancing models by computer solvers proved to be problematic if not applicable due to its computational instability. Other numerical methods available for solving Markov chains relay on constant transition rates or at least on rates that are not depending on the state probabilities. The proposed method combines analytical approach with the simple computations based on electronic tables and gives a solution in just a few iteration steps. It is designed especially for Markov chains in which transition rates are functions of the steady-state probabilities -- and that is the case of most dynamic load balancing schemes. The simplicity of this numerical method allows to compute the parameters for vast modeling space thus providing a broad picture of cloud servers' performance.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信