A simulation of priority based earliest deadline first scheduling for cloud computing system
Garima Gupta, Vimal Kr. Kumawat, Prasanna Laxmi, Dharmendra Singh, Vinesh Kumar Jain, Ravinder Singh · 2014
Cloud is a new trend in the computing. It is the combination of distributed, parallel and grid computing. It is a pay on demand computing. Basically cloud is a shared pool of resources. The resources are shared among users who are geographically distributed. As the area of cloud is increasing, several issues are also increasing. These issues are related to security, resource allocation, performance and cost. The paper has its main focus on the resource allocation problem and to solve the problem we are discussing a task allocation algorithm. The algorithm that we will discuss in this paper uses the two task scheduling algorithm one is priority based and other is earliest deadline first scheduling algorithm. The tasks are allocated on the basis of their priority and the task having higher priority get scheduled first. The simulation is performed on the CloudSim toolkit. CloudSim is a JAVA based simulator. The proposed work will results in higher performance and also improves memory utilization.