A Hierarchical Multi-Constrained Cost Efficient Qos-Driven Scheduling Heuristic for Computational Tasks in Grid Keerthika P*, Suresh P** *Assistant Professor, Department of Computer Science and Engineering, Kongu Engineering College, Perundurai, Erode, Tamil Nadu, India **Assistant Professor, Department of Information Technology, Kongu Engineering College, Perundurai, Erode, Tamil Nadu, India Online published on 3 May, 2016. Abstract In a Grid environment, a plenty of heterogeneous resources are shared among the users to solve complex problems that requires massive computational capability. In this view, scheduling algorithms plays a vital role in provisioning a suitable resource for executing a complex computational task. Also, the scheduling algorithms should address the issues that arise when an allocated resource fails. Resource allocation is an important phenomenon where several issues should be taken for consideration such as balancing the load of resources, handling resource failure, satisfying the user's demand and finally the cost for task execution. In this paper, we propose a scheduling heuristic (HMC-QoS) that addresses all these scheduling issues and performs better resource allocation. This heuristic works at three different levels of hierarchy and finds an appropriate resource for a task. It considers the factors like execution time, resource load, communication time, cost, and task completion deadline and failure history of resources for scheduling at each level. The proposed HMC-QoS heuristic is implemented and its performance is measured based on various performance metrics which involves makespan, task deadline hit, resource utilization, cost, and communication time and fault tolerance. The analysis shows that the proposed heuristic results in improved makespan and other metrics when compared with other existing algorithms. Top Keywords Fault tolerance, Load Balancing, Grid Scheduling, Meta-task, communication overhead, Resource Utilization, User satisfaction. Top |