Prioritized User Demand Approach for Scheduling Meta Tasks on Heterogeneous Grid Environment

Suresh, P.; Balasubramani, Prajwal; Keerthika, P.

doi:10.5120/2856-3670

Cited by 7 publications

(7 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A prioritized user demand algorithm is proposed by Suresh et al [3] in 2011 that considers user deadline for allocating jobs to different heterogeneous resources from different administrative domains. It produces more user satisfaction and better make-span but data requirement is not examined.…”

Section: Introductionmentioning

confidence: 99%

Efficient load balancing scheduling for deadline constrained tasks on grid computing

Jindal

Bansal

2014

2014 9th International Conference on Industrial and Information Systems (ICIIS)

View full text Add to dashboard Cite

Grid Computing provides scalable access to widearea distributed resources. Since, computational grid selects, shares and aggregates wide variety of geographically distributed computing resources and proposes them as a single resource for solving large scale computing applications but there is a need for a scheduling algorithm which takes into account the several requirements of grid environment. Hence, this research proposes a new scheduling algorithm for computational grids that considers user satisfaction, load balancing; fault tolerance based on the resource availability and job characteristics such as user deadline. This algorithm decreases the make-span of the schedule along with user satisfaction means more tasks are successfully completed within user deadline and balanced load means load on all the resources is balanced. The proposed algorithm improves the system parameter such as maximum variation in load; deadline hit count and make-span as compared to BSA.

show abstract

Section: Introductionmentioning

confidence: 99%

Efficient load balancing scheduling for deadline constrained tasks on grid computing

Jindal

Bansal

2014

2014 9th International Conference on Industrial and Information Systems (ICIIS)

View full text Add to dashboard Cite

show abstract

“…A prioritized user demand algorithm is proposed [26] that considers user deadline for allocating jobs to different heterogeneous resources from different administrative domains. It produces better makespan and more user satisfaction but data requirement is not considered.…”

Section: Introduction and Related Workmentioning

confidence: 99%

A Multiconstrained Grid Scheduling Algorithm with Load Balancing and Fault Tolerance

Keerthika¹,

Suresh²

2015

The Scientific World Journal

Self Cite

View full text Add to dashboard Cite

Grid environment consists of millions of dynamic and heterogeneous resources. A grid environment which deals with computing resources is computational grid and is meant for applications that involve 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. Allocation of resources 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 to design a resource allocation algorithm which is budget constrained and also targets load balancing, fault tolerance, and user satisfaction by considering the above requirements. The proposed Multiconstrained Load Balancing Fault Tolerant algorithm (MLFT) reduces the schedule makespan, schedule cost, and task failure rate and improves resource utilization. The proposed MLFT algorithm is evaluated using Gridsim toolkit and the results are compared with the recent algorithms which separately concentrate on all these factors. The comparison results ensure that the proposed algorithm works better than its counterparts.

show abstract

“…Prioritized user demand aware algorithm allocated jobs to the machines by considering user requirements of jobs. It results in more user satisfaction and better makespan, but data movement is not considered [14].…”

Section: Introductionmentioning

confidence: 99%

User Demand Aware Grid Scheduling Model with Hierarchical Load Balancing

Suresh¹,

Balasubramanie²

2013

Mathematical Problems in Engineering

Self Cite

View full text Add to dashboard Cite

Grid computing is a collection of computational and data resources, providing the means to support both computational intensive applications and data intensive applications. In order to improve the overall performance and efficient utilization of the resources, an efficient load balanced scheduling algorithm has to be implemented. The scheduling approach also needs to consider user demand to improve user satisfaction. This paper proposes a dynamic hierarchical load balancing approach which considers load of each resource and performs load balancing. It minimizes the response time of the jobs and improves the utilization of the resources in grid environment. By considering the user demand of the jobs, the scheduling algorithm also improves the user satisfaction. The experimental results show the improvement of the proposed load balancing method.

show abstract

Prioritized User Demand Approach for Scheduling Meta Tasks on Heterogeneous Grid Environment

Cited by 7 publications

References 14 publications

Efficient load balancing scheduling for deadline constrained tasks on grid computing

Efficient load balancing scheduling for deadline constrained tasks on grid computing

A Multiconstrained Grid Scheduling Algorithm with Load Balancing and Fault Tolerance

User Demand Aware Grid Scheduling Model with Hierarchical Load Balancing

Contact Info

Product

Resources

About