S. K. Pande, Priyanka Swain, S. K. Nayak, S. K. Panda
{"title":"多云环境下基于指标的任务调度算法","authors":"S. K. Pande, Priyanka Swain, S. K. Nayak, S. K. Panda","doi":"10.4018/ijcac.308274","DOIUrl":null,"url":null,"abstract":"Cloud computing is the ability to scale various resources and services that can be dynamically configured by the cloud service provider (CSP) and delivered on demand by the customers. The objective of most of the task scheduling algorithms is to ensure that the overall processing time of all the tasks (i.e., makespan) is minimized. Here, minimization of makespan in no way guarantees the minimization of execution cost. In indicator-based (IBTS) task scheduling algorithm for the multi-cloud environment, we can outline the significant contributions as the following: (1) IBTS achieves multi-objective solutions while considering parameters, makespan, and execution cost. (2) IBTS proposes a normalization framework with time and cost length indicators for efficient task scheduling. (3) The efficacy of the IBTS algorithm is demonstrated using both the benchmark and synthetic datasets. (4) The simulation outcomes of the IBTS algorithm in comparison with three existing task scheduling algorithms, namely ETBTS, MOTS, and PBTS, clearly exhibit superiority, which proves acceptance of IBTS algorithm.","PeriodicalId":442336,"journal":{"name":"Int. J. Cloud Appl. Comput.","volume":"190 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"An Indicator-Based Algorithm for Task Scheduling in Multi-Cloud Environments\",\"authors\":\"S. K. Pande, Priyanka Swain, S. K. Nayak, S. K. Panda\",\"doi\":\"10.4018/ijcac.308274\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Cloud computing is the ability to scale various resources and services that can be dynamically configured by the cloud service provider (CSP) and delivered on demand by the customers. The objective of most of the task scheduling algorithms is to ensure that the overall processing time of all the tasks (i.e., makespan) is minimized. Here, minimization of makespan in no way guarantees the minimization of execution cost. In indicator-based (IBTS) task scheduling algorithm for the multi-cloud environment, we can outline the significant contributions as the following: (1) IBTS achieves multi-objective solutions while considering parameters, makespan, and execution cost. (2) IBTS proposes a normalization framework with time and cost length indicators for efficient task scheduling. (3) The efficacy of the IBTS algorithm is demonstrated using both the benchmark and synthetic datasets. (4) The simulation outcomes of the IBTS algorithm in comparison with three existing task scheduling algorithms, namely ETBTS, MOTS, and PBTS, clearly exhibit superiority, which proves acceptance of IBTS algorithm.\",\"PeriodicalId\":442336,\"journal\":{\"name\":\"Int. J. Cloud Appl. Comput.\",\"volume\":\"190 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. J. Cloud Appl. Comput.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4018/ijcac.308274\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Cloud Appl. Comput.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4018/ijcac.308274","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An Indicator-Based Algorithm for Task Scheduling in Multi-Cloud Environments
Cloud computing is the ability to scale various resources and services that can be dynamically configured by the cloud service provider (CSP) and delivered on demand by the customers. The objective of most of the task scheduling algorithms is to ensure that the overall processing time of all the tasks (i.e., makespan) is minimized. Here, minimization of makespan in no way guarantees the minimization of execution cost. In indicator-based (IBTS) task scheduling algorithm for the multi-cloud environment, we can outline the significant contributions as the following: (1) IBTS achieves multi-objective solutions while considering parameters, makespan, and execution cost. (2) IBTS proposes a normalization framework with time and cost length indicators for efficient task scheduling. (3) The efficacy of the IBTS algorithm is demonstrated using both the benchmark and synthetic datasets. (4) The simulation outcomes of the IBTS algorithm in comparison with three existing task scheduling algorithms, namely ETBTS, MOTS, and PBTS, clearly exhibit superiority, which proves acceptance of IBTS algorithm.