Static task scheduling heuristic approach in cloud computing environment

Abstract

Scheduling is to assign a resource with a starting and ending time. Mapping refers to the assigning resource to the task without specifying the start time. Mapping can be possible in several conditions. Mapping can be possible when you know what tasks are scheduled or when you do not know what tasks are scheduled. If it is known then it only requires to choose the way so that it can be mapped correctly otherwise it needs to consider varying circumstances. The proposed article focuses on the way to choose an algorithm for mapping when the tasks are scheduled. This article also analyzes experimentally the different algorithms to get out the best of it in different conditions.