Fault Tolerant PLBGSA : Precedence Level Based Genetic Scheduling Algorithm for P2P Grid

Abstract EN

Due to monetary limitation, small organizations cannot afford high end supercomputers to solve highly complex tasks.

P2P (peer to peer) grid computing is being used nowadays to break complex task into subtasks in order to solve them on different grid resources.

Workflows are used to represent these complex tasks.

Finishing such complex task in a P2P grid requires scheduling subtasks of workflow in an optimized manner.

Several factors play their part in scheduling decisions.

The genetic algorithm is very useful in scheduling DAG (directed acyclic graph) based task.

Benefit of a genetic algorithm is that it takes into consideration multiple criteria while scheduling.

In this paper, we have proposed a precedence level based genetic algorithm (PLBGSA), which yields schedules for workflows in a decentralized fashion.

PLBGSA is compared with existing genetic algorithm based scheduling techniques.

Fault tolerance is a desirable trait of a P2P grid scheduling algorithm due to the untrustworthy nature of grid resources.

PLBGSA handles faults efficiently.