Scheduling of tasks in the grid environment is challenging compared to that in local computing service facilities. In the field of distributed and parallel computing grid computing plays a vital role for solving a wide range of large scale parallel applications. The main goal of task scheduling is to achieve high system throughput and to match the application with the available computing resour...

Grid resource scheduling theory involving basic theoretical knowledge for grid scheduling was discussed in this paper. Then an intensive study of the scheduling strategy was made. According to the heterogeneous characteristic of grid environment, an improved algorithm DIBS for task scheduling were proposed. In this algorithm, the entire scheduling process was divided into three steps: layering,...

Algorithms for scheduling tasks onto the heterogeneous processors must achieve remarkable performance in terms of scheduling length. Most of the scheduling algorithms do not provide the mechanism about minimum communication overhead. This paper introduces Optimal Task Partitioning Strategy with Duplication (OTPSD) that minimizes the scheduling length as well as communication overhead. The propo...

Scheduling of tasks is done by mapping tasks on multiple processors so that it requires least time for completion of all processes. Multiprocessors are used to run real time applications that uniprocessor systems would not be competent to execute. This paper presents various scheduling algorithms that schedule an edge-weighted Directed Acyclic Graph (DAG) to a number of processors. In this pape...

Dynamic adaptation techniques based on checkpointing is studied in this paper. Placing store-checkpoints and compare-checkpoints between CSCP (store-and-compare-checkpoint), we first present adaptive checkpointing schemes in which the checkpointing interval for a task is dynamically adjusted on line. Introducing the overheads of comparison and storage, the average execution times to complete a ...