Scribd
Upload
38 views

Load Balancing: by Sanjana Rosario 1RV12EC134

This document discusses load balancing techniques for distributing processes across computing tasks. It describes static load balancing which assigns tasks before program execution using algorithms like round robin, randomized, and recursive bisection. Dynamic load balancing redistributes processes during execution from heavily loaded to lightly loaded processors using centralized or decentralized techniques. The goal of load balancing is to minimize execution time and communication delays while maximizing resource utilization.

Uploaded by

Sanjana Rosario
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
38 views

Load Balancing: by Sanjana Rosario 1RV12EC134

This document discusses load balancing techniques for distributing processes across computing tasks. It describes static load balancing which assigns tasks before program execution using algorithms like round robin, randomized, and recursive bisection. Dynamic load balancing redistributes processes during execution from heavily loaded to lightly loaded processors using centralized or decentralized techniques. The goal of load balancing is to minimize execution time and communication delays while maximizing resource utilization.

Uploaded by

Sanjana Rosario
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 12

LOAD BALANCING

BY SANJANA ROSARIO
1RV12EC134
What is Load Balancing?
The distribution of processes among tasks
evenly and uniformly, so as to achieve certain
performance goals :

Minimizing Execution Time
Minimizing Communication Delays
Maximizing Resource Utilization.
Static Load Balancing
Assignment of tasks done before the
program execution.
Processor non-preemptive method.




predict the
program
execution
behavior at
compile time
perform a
partitioning of
smaller tasks
into coarser-
grain processes
allocate
processes to
processors.
Static Load Balancing Techniques
Round Robin Algorithm

Randomized Algorithm

Recursive Bisection


A
D
V
A
N
T
A
G
E
S

All the overhead
of the scheduling
process is incurred
at compile time,
resulting in a more
efficient execution
time.

Easy to design and
implement.
D
I
S
A
D
V
A
N
T
A
G
E
S

Unpredictable
Performance
degradation.

Run-time
communication
delays for
accessing data
at remote sites.
DYNAMIC LOAD BALANCING
Dynamic scheduling is based on the
redistribution of processes among the
processors during execution time.

This redistribution is performed by transferring
tasks from the heavily loaded processors to
the lightly loaded processors.
Dynamic Load Balancing Techniques
Centralized (Master Slave Structure)


Decentralized
Random Polling / Stealing
Transfer of information load at regular intervals

A
D
V
A
N
T
A
G
E
S

The system need not be
aware of the run-time
behavior of the
applications before
execution.
Flexibility
Useful in a system in
which the primary
performance goal is
maximizing utilization
of the processing power
instead of minimizing
execution time of the
applications.
D
I
S
A
D
V
A
N
T
A
G
E
S


run-time
overhead
Summary
Load
Balancing
Static
Round Robin
Randomized
Recursive
bisection
Dynamic
Centralized
Decentralized
References
http://www.dcc.fc.up.pt/~fds/aulas/PPD/0708
/lect10-loadbalance-1x2.pdf

http://www.dis.uniroma1.it/~ciciani/DIDATTI
CA/ARCHITETTURE/SchedLB.pdf

http://www.ics.uci.edu/~cs230/reading/parall
el.pdf

THANKYOU

You might also like