Abstrakt

A Partial Critical Path Based Approach for Grid Workflow Scheduling

Anagha Sharaf, Suguna.M

Grid Computing is a technique in which the idle systems in the Network and their CPU cycles can be efficiently used by uniting pools of servers, storage systems and networks into a single large virtual system for resource sharing dynamically. Utility grids are new service models in heterogenous distributed systems. Utility grids enable users to specify the quality requirements they need. The main challenge in grid computing is the efficient workflow scheduling. For scheduling workflows considering QoS specifications of user a metaheuristic algorithm is introduced. The algorithm is based on the concept of partial critical path. The algorithm includes two phases 1.deadline phase and 2.Planning phase. User submits deadline and other QoS specifications in deadline phase. The cheapest service is allotted to tasks inorder to satisfy QoS specifications and deadline in planning phase.