TY - JFULL AU - P. Keerthika and P. Suresh PY - 2015/3/ TI - A Budget and Deadline Constrained Fault Tolerant Load Balanced Scheduling Algorithm for Computational Grids T2 - International Journal of Computer and Information Engineering SP - 554 EP - 562 VL - 9 SN - 1307-6892 UR - https://publications.waset.org/pdf/10001333 PU - World Academy of Science, Engineering and Technology NX - Open Science Index 98, 2015 N2 - Grid is an environment with millions of resources which are dynamic and heterogeneous in nature. A computational grid is one in which the resources are computing nodes and is meant for applications that involves larger computations. A scheduling algorithm is said to be efficient if and only if it performs better resource allocation even in case of resource failure. Resource allocation is a tedious issue since it has to consider several requirements such as system load, processing cost and time, user’s deadline and resource failure. This work attempts in designing a resource allocation algorithm which is cost-effective and also targets at load balancing, fault tolerance and user satisfaction by considering the above requirements. The proposed Budget Constrained Load Balancing Fault Tolerant algorithm with user satisfaction (BLBFT) reduces the schedule makespan, schedule cost and task failure rate and improves resource utilization. Evaluation of the proposed BLBFT algorithm is done using Gridsim toolkit and the results are compared with the algorithms which separately concentrates on all these factors. The comparison results ensure that the proposed algorithm works better than its counterparts. ER -