Communication cost effective scheduling policies of nonclairvoyant jobs with load balancing in a grid

Zikos, Stylianos; Karatza, Helen D.

doi:10.1016/j.jss.2009.07.006

Cited by 31 publications

(16 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This algorithm keeps only static information of nodes, like remaining capacity of CPU and remaining memory. Reference [19] also updates the table on timely bases, the difference is that it stores dynamic load information rather than static load information.…”

Section: Related Workmentioning

confidence: 99%

Load Balancing in Partner-Based Scheduling Algorithm for Grid Workflow

Roman¹,

Ashraf²,

Habib³

et al. 2016

ijacsa

View full text Add to dashboard Cite

Abstract-Automated advance reservation has the potential to ensure a good scheduling solution in computational Grids. To improve global throughput of Grid system and enhance resource utilization, workload has to be distributed among the resources of the Grid evenly. This paper discusses the problem of load distribution and resource utilization in heterogeneous Grids in advance reservation environment. We have proposed an extension of Partner Based Dynamic Critical Path for Grids algorithm named Balanced Partner Based Dynamic Critical Path for Grids (B-PDCPG) that incorporates a hybrid and threshold based mechanism to achieve load balancing to an allowed value of variation in workload among the resources in Partner Based Dynamic Critical Path for Grids algorithm. The proposed load balancing technique uses Utilization Profiles to store the reservation details and check the loads from these profiles on each of the resources and links. The load is distributed among resources based on the processing element capacity and number of processing units on resources. The simulation results, using Gridsim simulation engine, show that the proposed technique has balanced the workload very effectively and has provided better utilization of resources while decreasing the workflow makespan.

show abstract

Section: Related Workmentioning

confidence: 99%

Load Balancing in Partner-Based Scheduling Algorithm for Grid Workflow

Roman¹,

Ashraf²,

Habib³

et al. 2016

ijacsa

View full text Add to dashboard Cite

show abstract

“…In literature, the researchers have proposed several loadbalancing strategies in Grid environments [6,7,[12][13][14][15][16][17][18][19][20][21][22][23][24][25][26][27].…”

Section: Related Workmentioning

confidence: 99%

“…Zikos et al [19] studied the site allocation scheduling of nonclairvoyant jobs in two-level heterogeneous grid architecture. Three scheduling policies at grid level which utilize site load information are examined.…”

Section: Related Workmentioning

confidence: 99%

An improved load-balancing mechanism based on deadline failure recovery on GridSim

Patel

Tripathy

2015

Engineering with Computers

View full text Add to dashboard Cite

failure of the Gridlets. Extensive simulation experiments are conducted to quantify the performance of the proposed load-balancing strategy on the GridSim platform. Experiments have shown that the proposed system can considerably improve Grid performance in terms of total execution time, percentage gain in execution time, average response time, resubmitted time and throughput. The proposed loadbalancing technique gives 7 % better performance than EGDC in case of constant number of resources, whereas in case of constant number of Gridlets, it gives 11 % better performance than EGDC.

show abstract

“…The clairvoyant algorithm [12] allocates the jobs to the suitable resources according to the characteristics of the jobs such as service time. On the other hand, the non-clairvoyant algorithm [12] unsystematically performs the job allocation to the resources without considering the characteristics of the job.…”

Section: Comparative Study Of Existing Load Balancing Algorithmsmentioning

confidence: 99%

A Comparative Study of Load Balancing Algorithms in Computational Grid Environment

Goswami¹,

Sarkar

2013

2013 Fifth International Conference on Computational Intelligence, Modelling and Simulation

View full text Add to dashboard Cite

Grids are a form of distributed computing whereby a 'super virtual computer' is composed of many networked loosely coupled computers acting together to perform very large tasks. This technology has been applied to computationally intensive scientific, mathematical and academic problems through volunteer computing, and it is used in commercial enterprises for many diverse applications. Computational grid provides resource sharing through multiinstitutional virtual organizations for dynamic problem solving. Load balancing is an important property in grid computing as the load scenarios of individual grid resources are dynamic in nature. In order to make computational grids more effective and reliable, balanced load across the grid is necessary. The objective of this paper is to review different existing load balancing algorithms or techniques applicable in grid computing. This paper also proposes an algorithm to solve the prevailing problem of dynamic load balancing with respect to deadline of job submitted by the clients.

show abstract

Communication cost effective scheduling policies of nonclairvoyant jobs with load balancing in a grid

Cited by 31 publications

References 18 publications

Load Balancing in Partner-Based Scheduling Algorithm for Grid Workflow

Load Balancing in Partner-Based Scheduling Algorithm for Grid Workflow

An improved load-balancing mechanism based on deadline failure recovery on GridSim

A Comparative Study of Load Balancing Algorithms in Computational Grid Environment

Contact Info

Product

Resources

About