MULTI-LEVEL PRIORITY SCHEDULING USING EASY AND IBA BACKFILL ALGORITHM

Abstract

Job scheduling (JS) is one of the important issues in a Cloud Computing system. The aim of Job scheduling systems in Cloud Computing is meeting the requirement and maximizing resource utilization. Parallel job scheduling strategies like EASY, conservative backfill algorithms have failed to maximize resource utilization. Even Improved Backfill Algorithm (IBA) using balanced spiral method, which provides high resource utilization, is not as helpful as it looks, in real scenario. Because it does not consider the priorities of the jobs. In this report, we have proposed a method which tries to maximize resource utilization and it also considers the priorities of the jobs. Here, we have proposed a Multi-Level Priority Scheduling (MLPS) using EASY and IBA backfill algorithm. This method tries to use the advantages of both the algorithms. We have also showed in the results that this method is going to perform quiet better than other algorithms in real scenario.