{"title":"云环境下大数据流异构公平资源分配与调度","authors":"R. Kiruthiga, D. Akila","doi":"10.1109/iccakm50778.2021.9357750","DOIUrl":null,"url":null,"abstract":"In this paper, Heterogeneous Fair Resource Allocation and Scheduling (HFRAS) for cloud based Big Data Streams, is proposed. In this algorithm, a weight value is determined for the user for each of the requested resource, based on the resource priorities. Then each task is assigned a task priority index (TPI) based on this weight value, task arrival time and expected end time (EET). The requested tasks are divided into various priority queues based on the TPI of the tasks assigned. Then tasks are sorted in the ascending order of TPI and scheduled in which the Dominant Resource Share (DRS) is determined for each user. Experimental results have shown that HFRAS attains lesser execution time, minimum response delay and maximum CPU utilization, when compared to the existing algorithm.","PeriodicalId":165854,"journal":{"name":"2021 2nd International Conference on Computation, Automation and Knowledge Management (ICCAKM)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Heterogeneous Fair Resource Allocation and Scheduling for Big Data Streams in Cloud Environments\",\"authors\":\"R. Kiruthiga, D. Akila\",\"doi\":\"10.1109/iccakm50778.2021.9357750\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, Heterogeneous Fair Resource Allocation and Scheduling (HFRAS) for cloud based Big Data Streams, is proposed. In this algorithm, a weight value is determined for the user for each of the requested resource, based on the resource priorities. Then each task is assigned a task priority index (TPI) based on this weight value, task arrival time and expected end time (EET). The requested tasks are divided into various priority queues based on the TPI of the tasks assigned. Then tasks are sorted in the ascending order of TPI and scheduled in which the Dominant Resource Share (DRS) is determined for each user. Experimental results have shown that HFRAS attains lesser execution time, minimum response delay and maximum CPU utilization, when compared to the existing algorithm.\",\"PeriodicalId\":165854,\"journal\":{\"name\":\"2021 2nd International Conference on Computation, Automation and Knowledge Management (ICCAKM)\",\"volume\":\"70 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-01-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 2nd International Conference on Computation, Automation and Knowledge Management (ICCAKM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/iccakm50778.2021.9357750\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 2nd International Conference on Computation, Automation and Knowledge Management (ICCAKM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/iccakm50778.2021.9357750","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Heterogeneous Fair Resource Allocation and Scheduling for Big Data Streams in Cloud Environments
In this paper, Heterogeneous Fair Resource Allocation and Scheduling (HFRAS) for cloud based Big Data Streams, is proposed. In this algorithm, a weight value is determined for the user for each of the requested resource, based on the resource priorities. Then each task is assigned a task priority index (TPI) based on this weight value, task arrival time and expected end time (EET). The requested tasks are divided into various priority queues based on the TPI of the tasks assigned. Then tasks are sorted in the ascending order of TPI and scheduled in which the Dominant Resource Share (DRS) is determined for each user. Experimental results have shown that HFRAS attains lesser execution time, minimum response delay and maximum CPU utilization, when compared to the existing algorithm.