Abstract:
In a distributed computing environment, availability of resources required by a task is an important factor for successful completion. Especially in Grid Computing, the n...Show MoreMetadata
Abstract:
In a distributed computing environment, availability of resources required by a task is an important factor for successful completion. Especially in Grid Computing, the nodes are not completely dedicated, hence efficient utilization of computing resources is a challenge. If a task requires a certain amount of CPU, memory, network bandwidth, storage space etc., it may fail or delay execution in case any or all of the resources required are not available. In this paper, a preventive scheduling mechanism is described, which takes into consideration the resource utilization of the nodes and based on the requirement, the tasks are scheduled with a fair chance of success. A comparison of this method with First come first serve algorithm is performed for nodes at different levels of load on the resources.
Published in: 2013 International Conference on Advances in Computing, Communications and Informatics (ICACCI)
Date of Conference: 22-25 August 2013
Date Added to IEEE Xplore: 21 October 2013
ISBN Information: