please provide me the ppt's ,report and code of dynamic scheduling in grid computing,,

---

shouib

Distributed Dynamic Scheduling of Composite Tasks on Grid Computing Systems
A Grid is a computing and data handling virtual system
formed by aggregating the diverse services provided by the
distributed resources.The emergence of a variety of new
applications demand that the Grids support efficient data
and resource management mechanisms.several issues including
fault-tolerance and stability must be addressed by the resource management system (RMS). the wide-area scheduling problem is examined in this paper. a large hierarchical graph is used to model the internet topology. A task is modeled as a directed acyclic
graph (DAG).

Assumptions and Problem Statement:
It is assumed that that the resources are connected via a twolevel
hierarchical network. The first level is a wide-area
network (WAN) that connects local area networks (LANs)
at the second-level.the load is shared by the computing nodes in the LAN.

Two-Phase Distributed Scheduling Algorithm:
The distributed scheduling algorithm presented has two
phases: external and internal scheduling.The internal phase is implemented by
a LAN-wide, subtask-level, and centralized scheduler. Internal scheduler is fully aware of the subtasks,
however, has no knowledge of other LANs. The following tasks are performed by internal scheduler:
1)receives tasks from external scheduler for execution,
2)replies to bid requests from the external scheduler
3)allocates resources for the different subtasks of a task,
4)sends task execution results back to the external scheduler.
5)gathers execution results of subtasks
The external phase is implemented by a WAN-wide, task-level, and distributed scheduler

For more details on this topic, refer this pdf: