Research Article
Decentralized Scheduling Algorithm for DAG Based Tasks on P2P Grid
Table 1
An example of an information list
on P2P grid node
.
| Twelve entities | Immediate neighbors of P2P grid resources | Node itself | Serial number | Name of entity | Node | Node | Node |
| 1 | Exclusive name of P2P grid resource | | | | | 2 | IP address of P2P grid node, | | | | | 3 | Waiting time for subtask to begin execution, | | | | | 4 | Number of processing elements present in P2P grid node, | | | | | 5 | MIPS of each processing element, | | | | | 6 | “Previous workload on P2P grid node, ” | | | | | 7 | “Window size between two nodes, Wsz” | | | | | 8 | “Round trip time between origin and direct neighbor node, RTT” | | | | | 9 | “Cost to send subtask on grid resource, ” | | | | | 10 | “Individual workload of subtask on grid resource, ” | | | | | 11 | “Assumed workload on grid resource after subtask is assigned to it, ” | | | | | 12 | “Time to return the result of subtask , to origin node, ” | | | | |
|
|