{"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}
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.