Pub Date : 2015-09-17DOI: 10.4172/2165-7866.1000155
Elhossiny Ibrahim, Nirmeen A. El-Bahnasawy, F. Omara
The Cloud Computing is a most recent computing paradigm where IT services are provided and delivered over the Internet on demand and pay as you go. On the other hands, the taskscheduling problem is considered one of the main challenges in the Cloud Computing environment, where a good mapping between the available resources and the users’s tasks is needed to reduce the execution time of the users’ tasks (i.e., reduce make-span), in the same time, increase the degree of capitalization from resources (i.e., increase resource utilization). In this paper, a new task scheduling algorithm has been proposed and implemented to reduce the make-span, as well as, increase the resources utilization by considering independent tasks. The proposed algorithm is based on calculating the total processing power of the available resources (i.e., VMs) and the total requested processing power by the users’ tasks,then allocating a group of users’ tasks to each VM according to the ratio of its needed power corresponding to the total processing power of all VMs. To evaluate the performance of the proposed algorithm, a comparative study has been done among the proposed algorithm, and the existed GA, and PSO algorithms. The experimental results show that the proposed algorithm outperforms other algorithms by reducing make-span and increasing the resources utilization.
{"title":"Job Scheduling based on Harmonization between the Requested and Available Processing Power in the Cloud Computing Environment","authors":"Elhossiny Ibrahim, Nirmeen A. El-Bahnasawy, F. Omara","doi":"10.4172/2165-7866.1000155","DOIUrl":"https://doi.org/10.4172/2165-7866.1000155","url":null,"abstract":"The Cloud Computing is a most recent computing paradigm where IT services are provided and delivered over the Internet on demand and pay as you go. On the other hands, the taskscheduling problem is considered one of the main challenges in the Cloud Computing environment, where a good mapping between the available resources and the users’s tasks is needed to reduce the execution time of the users’ tasks (i.e., reduce make-span), in the same time, increase the degree of capitalization from resources (i.e., increase resource utilization). In this paper, a new task scheduling algorithm has been proposed and implemented to reduce the make-span, as well as, increase the resources utilization by considering independent tasks. The proposed algorithm is based on calculating the total processing power of the available resources (i.e., VMs) and the total requested processing power by the users’ tasks,then allocating a group of users’ tasks to each VM according to the ratio of its needed power corresponding to the total processing power of all VMs. To evaluate the performance of the proposed algorithm, a comparative study has been done among the proposed algorithm, and the existed GA, and PSO algorithms. The experimental results show that the proposed algorithm outperforms other algorithms by reducing make-span and increasing the resources utilization.","PeriodicalId":297925,"journal":{"name":"Journal of Information Technology & Software Engineering","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122430052","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：