An Efficient Grid Scheduling Algorithm with Fault Tolerance and User Satisfaction

Table 1

Terms and abbreviations.

UD𝑇𝑖	User deadline of task 𝑖 in seconds
ETC𝑇𝑖,𝑅𝑗	Expected time to compute matrix of size 𝑚×𝑛 where 𝑚 represents the number of tasks and 𝑛 represents the number of resources involved in seconds
RT𝑅𝑗	Ready time of resource 𝑗 in seconds
CT𝑇𝑖,𝑅𝑗	Completion time of each task 𝑖∈𝑚 on each resource 𝑗∈𝑛 in seconds
CMT𝑇𝑖,𝑅𝑗	Communication time of each task 𝑖∈𝑚 on each resource 𝑗∈𝑛 in seconds
ipt𝑇𝑖,𝑅𝑗	Time taken by 𝑇𝑖 for transfer of input files to the resource 𝑅𝑗 in seconds
opt𝑇𝑖,𝑅𝑗	Time taken by 𝑇𝑖 for transfer of output files to the user from the resource 𝑅𝑗 in seconds
TCT𝑇𝑖,𝑅𝑗	Total completion time of each task 𝑖∈𝑚 on each resource 𝑗∈𝑛 in seconds
FR𝑅𝑗	Failure rate of resource 𝑗
FV𝑇𝑖,𝑅𝑗	Fitness value of task 𝑖 with resource 𝑗
FFR	Failure rate fitness function
𝐹Diff	Difference fitness function