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, IP𝑁	IP𝑊	IP𝑈	IP𝑌	IP𝑋
3	Waiting time for subtask 𝑡 to begin execution, Pdld	Pdld	Pdld	Pdld	Pdld
4	Number of processing elements present in P2P grid node, PE𝑁	PE𝑊	PE𝑈	PE𝑌	PE𝑋
5	MIPS of each processing element, 𝐶^𝑁MIPS	𝐶^𝑊MIPS	𝐶^𝑈MIPS	𝐶^𝑌MIPS	𝐶^𝑋MIPS
6	“Previous workload on P2P grid node, Wld^Old𝑁”	Wld^Old𝑊	Wld^Old𝑈	Wld^Old𝑌	Wld^Old𝑋
7	“Window size between two nodes, Wsz”	Wsz𝑊𝑋	Wsz𝑈𝑋	Wsz𝑌𝑋	Wsz𝑋𝑋
8	“Round trip time between origin and direct neighbor node, RTT”	RTT𝑊𝑋	RTT𝑈𝑋	RTT𝑌𝑋	RTT𝑋𝑋
9	“Cost to send subtask 𝑡 on grid resource, Trt^𝑡𝑋𝑁”	Trt^𝑡𝑋𝑊	Trt^𝑡𝑋𝑈	Trt^𝑡𝑋𝑌	Trt^𝑡𝑋𝑋
10	“Individual workload of subtask 𝑡 on grid resource, ld^𝑡𝑁”	ld^𝑡𝑊	ld^𝑡𝑈	ld^𝑡𝑌	ld^𝑡𝑋
11	“Assumed workload on grid resource after subtask 𝑡 is assigned to it, Wld^𝑡𝑁”	Wld^𝑡𝑊	Wld^𝑡𝑈	Wld^𝑡𝑌	Wld^𝑡𝑋
12	“Time to return the result of subtask 𝑡, to origin node, Rb^𝑡𝑁”	Rb^𝑡𝑊	Rb^𝑡𝑈	Rb^𝑡𝑌	Rb^𝑡𝑋