期刊名称:International Journal of Computer Science and Information Technologies
电子版ISSN:0975-9646
出版年度:2015
卷号:6
期号:2
页码:1328-1332
出版社:TechScience Publications
摘要:The model of cloud computing has been evolved as a very popular and interesting model that concentrates on the on demand services very efficiently whenever they are needed by cloud terminals. In a quite different computing style, the delivery of massively scalable resources to the end users/clients/customers is carried out ‘as a service’ within the cloud systems using internet as a communication channel. In the cloud systems, the selection of the best suitable resources for the execution of arriving tasks is decided by the used scheduling strategies after considering some static and dynamic behaviour and the restrictions applied on them. From the users’ point of view, some other issues like task execution cost or task completion time may become essential parameters for deciding the scheduling algorithm efficient. The service providers always try to provide the resources in optimized manner so that the utilization of resources may be optimum and the resource potential might be left minimum. This paper proposes an efficient scheduling algorithm by which these big challenges may be addressed efficiently in the cloud systems. The arriving tasks would be bound after measuring them on the basis of their requirement like minimum task execution cost or minimum task completion time and their priority levels. The selection of the resources would be made on the basis of greedy approach based task constraints. This proposed work has been implemented, tested, validated and verified on a simulator. Results Show the effectiveness and correctness of the proposed framework and come out with a significant improvement over sequential scheduling algorithms.