الفهرس | Only 14 pages are availabe for public view |
Abstract Background/Objectives: Cloud computing is a large-scale distributed computing paradigm in which a pool of abstracted, virtualized, dynamically-scalable resources such as computing power, storage, platforms and services are delivered on demand to external customers over the Internet. In cloud computing scheduling is the process of deciding how to allocate resources in the form of virtual machines for the requested jobs. The aim of this thesis is to design a model to schedule tasks and distribute them on the processors within its deadline and make a load balancing.Methods: The proposed Deadline Aware Two Stage Scheduling in cloud computing is to schedule Virtual Machines (VM) for the requested jobs received from customers. In this model each job will pass two stages in a sequence to complete its task. This model allocates VM’s as resource to the requested jobs based on processing time and scheduling the jobs by considering deadlines with respect to response time and waiting time. Findings and Improvements: A Matlab program was developed to evaluate thismodel by considering the evaluation metrics of average turnaround time, cost and violation in deadlines.When compared with Earliest deadline first (EDF) , Max-Min and Min-Min scheduling strategies. This model reduces the evaluation metrics when compared with other scheduling approaches. |