In this paper, the authors propose an optimized version of the FCFS scheduling algorithm to address the major challenges of task scheduling in cloud. The incoming tasks are grouped on the basis of task requirement like minimum execution time or minimum cost and prioritized (FCFS manner). Resource selection is done on the basis of task constraints using a greedy approach. The proposed model will be implemented and tested on simulation toolkit. They intend to create a module depicting the normal FCFS algorithm in comparison to their optimized version algorithm for resource provisioning in the cloud.
Search to explore resources
