Dynamic Load Balancer Algorithm for the Computational Grid Environment

N/ACitations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

One of the challenging issues in computational grid is load balancing. In many approaches load balancing is done only at the local scheduler level, which is applicable to small application and leads to more communication overhead between the resources. For the large scale application load balancing at the local scheduler level will not provide the feasible solution. So the novel Load Balancer algorithm is proposed, which provides the load balancing at the meta-scheduler level. To initiate the load balancing triggering policy is used, which determines the appropriate time period to start the load balancing operation by using Boundary value approach. This approach increases the performance by reducing the waiting time of jobs and by maximizing the utilization resource which is least loaded. © Springer-Verlag Berlin Heidelberg 2010.

Cite

CITATION STYLE

APA

Rajavel, R., Somasundaram, T. S., & Govindarajan, K. (2010). Dynamic Load Balancer Algorithm for the Computational Grid Environment. In Communications in Computer and Information Science (Vol. 101, pp. 223–227). https://doi.org/10.1007/978-3-642-15766-0_32

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free