الفهرس 
Title : Proposed Algorithm for Optimal Resource Allocation for Cloud Computing Environments
Table of ContentsOnly 14 pages are availabe for public view
 |  | from | 146 |  |  |
| | | from | 146 | | |
Abstract
Cloud Computing is defined using common software, infrastructure, virtual machines (VMs), and other cloud resources as services. It is a computing model in which customers can get their required infrastructure without the need to buy it. As the concept of hiring, customers pay only for what they use and can be used on request.The scheduling process on cloud computing is a method used to define the most convenient deployment for the available tasks, resources, or jobs on the cloud. In other words, cloud scheduling is to find the appropriate function that maps tasks into their best matching virtual machines.There are many various cloud scheduling algorithms used to coordinate between the tasks and the appropriate resources to get the best and most efficient way of resources usage, considering some measurement factors to get the least value of time, minimum value of cost, minimum value of delay and to maximize the resources utilization. This thesis presents a newly proposed model called Dynamic Three Stages Task Scheduling Algorithm (DTSTSA) and assesses it based on different performance metrics.The DTSTSA works as a strategy of three stages. In the first stage, a job classifier is used for task classification; it helps to pre-create different types of virtual machines based on a last documented historical database, to predict the most common task types and their appropriate matching virtual machine types. It saves the time needed to create virtual machines during the scheduling process