A Hybrid Scheduling Algorithm with Load Balancing for Computational Grid

Keerthika, P.; Kasthuri, N.

doi:10.14257/ijast.2013.58.02

Cited by 12 publications

(8 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the general case, task scheduling is a multi-objective problem in grid systems. Over the last decade, significant research has been carried out in the field of task planning for distributed and parallel systems from the standpoint of minimizing task execution time and calculation cost and optimizing resource utilization [21], security [22] and fault tolerance [23]. In [24], the different scheduling algorithms were summarized based on the grid system structure, showing that the minimal computation value is achieved by a combination of genetic algorithms and other types of algorithms.…”

Section: Methods and Algorithms For Task Schedulingmentioning

confidence: 99%

Modified Hierarchical Method for Task Scheduling in Grid Systems

AlZubi¹

2017

ijacsa

View full text Add to dashboard Cite

Abstract-This study aims to increase the productivity of grid systems by an improved scheduling method. A brief overview and analysis of the main scheduling methods in grid systems are presented. A method for increasing efficiency by optimizing the task graph structure considering the grid system node structure is proposed. Task granularity (the ratio between the amount of computation and transferred data) is considered to increase the efficiency of planning. An analysis of the impact on task scheduling efficiency in a grid system is presented. A correspondence of the task graph structure considering the node structure (in which the task is immersed) to the effectiveness of scheduling in a grid system is shown. A modified method for scheduling tasks while considering their granularity is proposed. The relevant algorithm for task scheduling in a grid system is developed. Simulation of the proposed algorithm using the modeling system GridSim is conducted. A comparative analysis between the modified algorithm and the algorithm of the hierarchical scheduler Maui is shown. The general advantages and disadvantages of the proposed algorithm are discussed.

show abstract

Section: Methods and Algorithms For Task Schedulingmentioning

confidence: 99%

Modified Hierarchical Method for Task Scheduling in Grid Systems

AlZubi¹

2017

ijacsa

View full text Add to dashboard Cite

show abstract

“…The load of each processing element is calculated by using the weighted sum of squares which is given by

\begin{matrix} T1 \\ L o a d ({P E}_{i}) = \sqrt{{true \sum}_{k = 1}^{n} (|, {a_{k} L}_{k}^{normal2})}, \end{matrix}

where L k is the load attribute considered in our algorithm [24]. The load attribute considered in our algorithm is the CPU utilization in seconds.…”

Section: Methodsmentioning

confidence: 99%

“…The main contribution of this paper includes achieving user satisfaction along with fault tolerance and minimizing the makespan of jobs. In our previous work [24], we have proposed a multicriteria scheduling algorithm that considers load balancing, fault tolerance, and user satisfaction as a centralized approach.…”

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

“…The main contributions of this paper are twofold. First, the scheduling algorithm balances the system load with an adaptive threshold and second, it minimizes the makespan of jobs A hybrid scheduling algorithm with load balancing for computational grid [5], proposes a new scheduling algorithm for computational grids that considers load balancing, fault tolerance and user satisfaction based on the grid architecture, resource heterogeneity, resource availability and job characteristics such as user deadline. This algorithm reduces the makespan of the schedule along with user satisfaction and balanced load.…”

Section: Load Balancing and Bandwidth In Grid Computingmentioning

confidence: 99%

TRP Maximization Technique based Efficient Scheduling in Grid Environment

Indhumathi¹

2018

IJSRCSE

View full text Add to dashboard Cite

-The problem of heterogeneous job scheduling in grid environment is well studied. Number of approaches considers different factors of resource and process in terms of completion, waiting and throughput. However, the methods suffer to achieve higher performance in scheduling in grid environment. To improve the performance, an efficient TRP maximization algorithm is presented in this paper. First, the method identifies list of processes and their required resource with their hold time. Based on the information obtained, a set of two hop sequences are generated for each resource available. For each two hop sequence, the method compute throughput maximization support, resource utilization maximization factor and process completion maximization factor. Using all these, a scheduling maximization support has been estimated. Based on the support measure a single one has been selected for each resource available. The same will be iterated for each level of scheduling and the method produces higher efficiency in scheduling. The performance of scheduling has been improved with less waiting time.

show abstract

A Hybrid Scheduling Algorithm with Load Balancing for Computational Grid

Abstract: Abstract

Cited by 12 publications

References 35 publications

Modified Hierarchical Method for Task Scheduling in Grid Systems

Modified Hierarchical Method for Task Scheduling in Grid Systems

A Multiconstrained Grid Scheduling Algorithm with Load Balancing and Fault Tolerance

TRP Maximization Technique based Efficient Scheduling in Grid Environment

Contact Info

Product

Resources

About