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

Table 1

Fault tolerant PLBGSA for P2P grid.

Begin		Cost	Time
(1)	Construct priority based subtask sequence 𝛽	𝑐1	1
(2)	Assign level 𝑙=0	𝑐2	1
(3)	Do	𝑐3	𝑛+1
(4)	Choose all 𝑗 subtasks present at level 𝑙 from 𝛽	𝑐4	𝑛+1
(5)	if  Ntl==1	𝑐5	𝑛+1
(6)	Single subtask ST^𝑙𝑆 assigned to node having minimum	𝑐6	𝑛+1
	Wld^ST𝑆𝑁 where 𝑁∈[0,𝑃−1]
(7)	Endif
(8)	if  Ntl>1	𝑐7	𝑛+1
(9)	for  𝑖=0 to ℎ	𝑐8	(𝑛+1)(𝑛+1)
(10)	Using RnG  assign all ST^𝑙𝑗 to set 𝑃	𝑐9	𝑛(𝑛+1)
(11)	Calculate Ftm_ST^𝑙𝑗	𝑐10	𝑛(𝑛+1)
(12)	Finish time value of Sd^𝑙𝑗𝑖=Ftm_ST^𝑙𝑗	𝑐11	𝑛(𝑛+1)
(13)	Endfor
(14)	GNo=2	𝑐12	𝑛+1
(15)	for  𝑖=ℎ  to (𝑢×ℎ)−1	𝑐13	(𝑛+1)(𝑘⋅𝑛+1)
(16)	if  𝑖%ℎ==𝑟 where 𝑟∈[0,𝑘−1]	𝑐14	𝑘⋅𝑛(𝑛+1)
(17)	Using RWS choose Sd^𝑙𝑗𝑖 schedule from Rng_Sd	𝑐15	(𝑛+1)(𝑘⋅𝑛−1)
	where Rng_Sd ∈[(𝑖−ℎ+𝑟),(ℎ−𝑟+1)]
(18)	Calculate Ftm_ST^𝑙𝑗	𝑐16	(𝑛+1)(𝑘⋅𝑛−1)
(19)	Endif
(20)	if  𝑖%ℎ==𝑒 where 𝑒∈[𝑘,(GNo×ℎ)−1]	𝑐17	(𝑘⋅𝑛)(𝑛+1)
(21)	Shortlist Sd^𝑙1st and Sd^𝑙2nd from Rng_Sd	𝑐18	(𝑛+1)(𝑘⋅𝑛−1)
	where Rng_Sd ∈[((GNo×ℎ)−ℎ),((GNo×ℎ)−ℎ+𝑘)]
(22)	using CxGO (occasional MtGO) on Sd^𝑙1st and Sd^𝑙2nd we obtain Sd^𝑙𝑗𝑖	𝑐19	(𝑛+1)(𝑘⋅𝑛−1)
(23)	Calculate Ftm_ST^𝑙𝑗	𝑐20	(𝑛+1)(𝑘⋅𝑛−1)
(24)	if  𝑒==(GNo×ℎ)−1	𝑐21	(𝑛+1)(𝑘⋅𝑛−1)
(25)	GNo++	𝑐22	(𝑛+1)(𝑘⋅𝑛−2)
(26)	Endif
(27)	if  𝑖==(𝑢×ℎ)−1	𝑐23	(𝑛+1)(𝑘⋅𝑛−1)
(28)	Shortlist Sd^𝑙smallest from Rng_Sd where Rng_Sd∈[0,	𝑐24	(𝑛+1)(𝑘⋅𝑛−2)
	((𝑢×ℎ)−1)]
(29)	for  𝑓=ℎ to (𝑢×ℎ)−1	𝑐25	(𝑘⋅𝑛−2)(𝑘⋅𝑛+1)(𝑛+1)
(30)	Sd^𝑙𝑗𝑓=Sd^𝑙smallest	𝑐26	(𝑛+1)(𝑘⋅𝑛−2)(𝑘⋅𝑛)
(31)	Endfor
(32)	Endif
(33)	Endif
(34)	Endfor
(35)	Endif
(36)	if  NdF==1	𝑐27	(𝑛+1)(𝑛+1)
(37)	Remove failed node from set 𝑃	𝑐28	𝑛(𝑛+1)
(38)	Goto step 3	𝑐29	𝑛(𝑛+1)
(39)	End if
(40)	𝑙++	𝑐30	(𝑛+1)(𝑛+1)
(41)	while  𝑙<= Max Level	𝑐31	(𝑛+1)(𝑛+1)
(42)	End do While
(43)	Finish time for Sd^𝑙smallest at level 𝑙= Max Level will be the finish time of	𝑐32	1
	task 𝑡
END