Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.

Fault Tolerant Scheduling of Partitioned and Grouped Jobs in Grid Computing (FTPG)

Abstract

Computational grids have the potential for solving scientific and large - scale problems using heterogeneous and geographically distributed resources In addition to the challenges of managing and scheduling resources reliable challenges arise because the grid infrastructure is unreliable There are two major problems in Scheduling the Grid 1 Efficient Scheduling of jobs 2 Providing fault tolerance in a reliable manner Most of the existing strategies do not provide fault tolerance There are some algorithms which provide fault tolerance but they do a large amount of redundant computation to provide fault tolerance This paper addresses this issue and minimizes redundant work by using a group level table of data This technique is suitable for partitioning and group scheduling of job

Similar works

Full text

thumbnail-image

Global Journal of Computer Science and Technology (GJCST)

redirect
Last time updated on 19/10/2022

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.