On efficiency of grid computing scheduling algorithms

Abstract

In this thesis author has given scheduling algorithms which are not only fruitful in optimizing schedule but also it does so in fully decentralized fashion. Hence, this unconventional approach suits well for P2P grid systems. Moreover, these algorithms take accurate scheduling decisions depending on both computation cost and communication cost associated with DAG s subtasks. Decentralized grid scheduling algorithms mentioned in this thesis crave to reduce schedule utilizing various techniques.