Design and analysis of multi Constrained scheduling algorithms For computational grid

Abstract

The computational power of individual computers is rapidly newlineincreasing from time to time In order to meet the computational demand newlinepowerful distributed and parallel systems with more number of processors are newlinedeveloped A grid is a hardware and software infrastructure that provides a newlinedependable consistent pervasive and inexpensive access to high performance newlinecomputing resources It requires methods for managing the resources and also newlinecreates new challenges in resource availability accessibility security newlineauthorization software compatibility and portability newlineGrid scheduling is a method for managing the grid resources and newlineallocating them to the tasks that require additional computing power In newlinecomputational grid different types of scheduling arise Based on dynamicity newlinescheduling can be categorized as static and dynamic Different modes such as newlinebatch and immediate scheduling also exist Based on resource control it is newlinecategorized as centralized decentralized and hierarchical newlineGrid environment comprises of heterogeneous and geographically newlinedistributed resources So the process of scheduling among those grid newlineresources becomes a tedious task Many solutions have been identified by the newlineresearchers for the grid scheduling problem newline newline newline