Performance Evaluation of QoS Parameters of Hybrid TLPD Scheduling algorithm in Cloud Computing Environment

Abstract: In recent years, cloud computing has changed the way that resources are used, allowing users to request resources whenever they need them. The scheduler of cloud computing uses task scheduling and resource allocation algorithms for efficient and effective load balancing of a workload among cloud resources to improve the overall performance of the cloud system when the highly incoming user requests are coming for the resources. But cloud providers are limited by the amount of resources they have, and are thus compelled to strive to maximum utilization. When the credit based task length & priority scheduling algorithm is used to schedule the task without knowing the deadline of the task, it will cause the dead of the task that having least deadline. In this paper a new hybrid approach (Hybrid TLPD) is designed which is a combination of credit based task length & priority algorithm (TLP) and credit based deadline algorithm. In the new hybrid algorithm, the assigning number of resources to the tasks in such a way that there will be minimum execution time and minimum response time is achieved. With the help of Cloudsim and Net beans IDE8.0 the designed algorithm is simulated and analyzed the results.

Keywords: Task length & Priority, Hybrid TLPD, FCFS, SJF, Cloudsim