Comparison between Deadline Based and Improved cost based Task scheduling Algorithm: a Perspective View

Computer Science

Cloud computing systems rely heavily on task scheduling for their operation. Task scheduling cannot be achieved by relying on just one factor, but rather it must be achieved by following a set of agreed upon rules and guidelines. A contract is nothing but the degree of service that a customer demands from a provider. One of the most important tasks of the providers is to provide high quality service to their users. At the same time there are a lot of other things going on behind the scene. In this paper we focuses on Task scheduling problem with two of the algorithms. The task scheduling problem is Finding the best way to map/assign sets of subtasks of various tasks to available sets of resources so that we can accomplish our desired goals for each task. We are going to compare Two algorithms for their suitability, feasibility, adaptability in the context of cloud scenarios. To improve the quality and reliability of cloud services.

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.