{"title":"为云服务提供商开发智能作业分配模型","authors":"Sourav Banerjee, Mainak Adhikari, U. Biswas","doi":"10.1109/ICBIM.2014.6970946","DOIUrl":null,"url":null,"abstract":"Cloud Computing is known as a provider of dynamic services. It utilizes a very large, scalable and virtualized resource over the Internet. So many industries have joined this bandwagon nowadays. One of the major research issues is to maintain good Quality of Service (QoS) of a Cloud Service Provider (CSP). The QoS encompasses different parameters, like, smart job allocation strategy, efficient load balancing, response time optimization, reduction in wastage of bandwidth, accountability of the overall system, etc. The efficient allocation strategy of the independent computational jobs among different Virtual Machines (VM) in a Datacenter (DC) is a distinguishable challenge in the Cloud Computing domain and finding out an optimal job allocation strategy guided by a good scheduling heuristic for such an environment is an NP-complete problem. So different heuristic approaches may be used for better result. The related works with other NP- complete problems have shown that solutions guided by heuristic approaches can often be improved by applying local scheduling procedure for allocating independent jobs in the virtual machines (VM) inside a Datacenter (DC), which, when combined with fast construction heuristics, can find out the shorter schedules on benchmark problems than the other solution methodologies found in different literatures, and in significant less time. This paper highlights a smart job allocation strategy for a CSP by applying Round-Robin (RR) scheduling policy.","PeriodicalId":6549,"journal":{"name":"2014 2nd International Conference on Business and Information Management (ICBIM)","volume":"85 1","pages":"114-119"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Development of a smart job allocation model for a Cloud Service Provider\",\"authors\":\"Sourav Banerjee, Mainak Adhikari, U. Biswas\",\"doi\":\"10.1109/ICBIM.2014.6970946\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Cloud Computing is known as a provider of dynamic services. It utilizes a very large, scalable and virtualized resource over the Internet. So many industries have joined this bandwagon nowadays. One of the major research issues is to maintain good Quality of Service (QoS) of a Cloud Service Provider (CSP). The QoS encompasses different parameters, like, smart job allocation strategy, efficient load balancing, response time optimization, reduction in wastage of bandwidth, accountability of the overall system, etc. The efficient allocation strategy of the independent computational jobs among different Virtual Machines (VM) in a Datacenter (DC) is a distinguishable challenge in the Cloud Computing domain and finding out an optimal job allocation strategy guided by a good scheduling heuristic for such an environment is an NP-complete problem. So different heuristic approaches may be used for better result. The related works with other NP- complete problems have shown that solutions guided by heuristic approaches can often be improved by applying local scheduling procedure for allocating independent jobs in the virtual machines (VM) inside a Datacenter (DC), which, when combined with fast construction heuristics, can find out the shorter schedules on benchmark problems than the other solution methodologies found in different literatures, and in significant less time. This paper highlights a smart job allocation strategy for a CSP by applying Round-Robin (RR) scheduling policy.\",\"PeriodicalId\":6549,\"journal\":{\"name\":\"2014 2nd International Conference on Business and Information Management (ICBIM)\",\"volume\":\"85 1\",\"pages\":\"114-119\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 2nd International Conference on Business and Information Management (ICBIM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICBIM.2014.6970946\",\"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 2nd International Conference on Business and Information Management (ICBIM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICBIM.2014.6970946","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Development of a smart job allocation model for a Cloud Service Provider
Cloud Computing is known as a provider of dynamic services. It utilizes a very large, scalable and virtualized resource over the Internet. So many industries have joined this bandwagon nowadays. One of the major research issues is to maintain good Quality of Service (QoS) of a Cloud Service Provider (CSP). The QoS encompasses different parameters, like, smart job allocation strategy, efficient load balancing, response time optimization, reduction in wastage of bandwidth, accountability of the overall system, etc. The efficient allocation strategy of the independent computational jobs among different Virtual Machines (VM) in a Datacenter (DC) is a distinguishable challenge in the Cloud Computing domain and finding out an optimal job allocation strategy guided by a good scheduling heuristic for such an environment is an NP-complete problem. So different heuristic approaches may be used for better result. The related works with other NP- complete problems have shown that solutions guided by heuristic approaches can often be improved by applying local scheduling procedure for allocating independent jobs in the virtual machines (VM) inside a Datacenter (DC), which, when combined with fast construction heuristics, can find out the shorter schedules on benchmark problems than the other solution methodologies found in different literatures, and in significant less time. This paper highlights a smart job allocation strategy for a CSP by applying Round-Robin (RR) scheduling policy.