2013Unpublished venueRequires access

PROXIMITY AWARE LOAD BALANCING FOR HETEROGENEOUS NODES

Yogita A. Dalvi, Ravi Shankar, Atesh Kumar

Open publisher page 0 citations

Abstract

Conventional load balancing schemes are efficient at increasing the utilization of CPU, memory, and disk I/O resources in a Distributed environment. Most of the existing load-balancing schemes ignore network proximity and heterogeneity of nodes. Load balancing becomes more challenging as load variation is very large and the load on each server may change dramatically over time, by the time when a server is to make the load migration decision, the collected load status from other servers may no longer be valid. This will affect the accuracy, and hence the performance, of the load balancing algorithms. All the existing methods neglect the heterogeneity of nodes and contextual load balancing. In this seminar, context based load balancing and task allocation with network proximity of heterogeneous nodes will be studied.

About this research paper

What this paper is about

Conventional load balancing schemes are efficient at increasing the utilization of CPU, memory, and disk I/O resources in a Distributed environment. Most of the existing load-balancing schemes ignore network proximity and heterogeneity of nodes. Load balancing becomes more challenging as load variation is very large and the load on each server may change dramatically over time, by the time when a server is to make the load migration decision, the collected load status from other servers may no longer be valid. This will affect the accuracy, and hence the performance, of the load balancing algorithms. All the existing methods neglect the heterogeneity of nodes and contextual load balancing. In this seminar, context based load balancing and task allocation with network proximity of heterogeneous nodes will be studied.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Conventional load balancing schemes are efficient at increasing the utilization of CPU, memory, and disk I/O resources in a Distributed environment. Most of the existing load-balancing schemes ignore network proximity and heterogeneity of nodes. Load balancing becomes more challenging as load variation is very large and the load on each server may change dramatically over time, by the time when a server is to make the load migration decision, the collected load status from other servers may no longer be valid. This will affect the accuracy, and hence the performance, of the load balancing algorithms. All the existing methods neglect the heterogeneity of nodes and contextual load balancing. In this seminar, context based load balancing and task allocation with network proximity of heterogeneous nodes will be studied.

Key concepts: Load balancing (electrical power), Computer science, Network Load Balancing Services, Round-robin DNS, Load management, Distributed computing, Server, Load distribution

Related papers

Back to paper searchBrowse research topicsOriginal source
PROXIMITY AWARE LOAD BALANCING FOR HETEROGENEOUS NODES — Research Paper | ScholarLens