LOAD BALANCING IN PARALLEL COMPUTING

TEAM MEMBERS:HEMANT SHARMA RAJNISH BISHNOI
1

or other resources.Introduction to Load Balancing In terms computer networking the load balancing Is a technique to distribute workload evenly across two or more computers. 2 . in order to get optimal resource utilization & maximize throughput or minimize the response time & avoid overload . CPUs. hard drives. network links.

3.Types of Parallel Computers y The parallel computers are classified as y y shared memory distributed memory processors memory network 3 y Both shared and distributed memory systems have: 1. . 2.

Interconnect Method There is no single way to connect bunch of processors y The manner in which the nodes are connected Network & Topology(mesh.star). 4 .

Block Diagrams Memory Interconnection Network P1 P2 P3 P4 P5 Processors A Shared Memory Parallel Computer 5 .

Block Diagrams Interconnection Network P1 P2 P3 P4 P5 M1 M2 M3 M4 M5 A Distributed Memory Parallel Computer 6 .

PROCESS IN SERIAL COMPUTING 7 .

PROCESS IN PARALLEL COMPUTING 8 .

Types of parallelism y Control parallelism (Algorithmic parallelism): y Data parallelism 9 .

Parallel Programming Models Different approaches are used in the development of parallel programs y Shared Variable Model: y Message Passing Model: 10 .

reservations 11 .Load Sharing and Queuing System y Keep track of available nodes in the system y Allot nodes to jobs y Maintain job queues with job priority.

Distributed scheduling Distributed scheduling is composed of two parts: Local Scheduling Global Scheduling 12 .

........Network connectivity in Distributed System P1 . P2 Pk Computer N/W Pk+1 .. Pn-1 Pn 13 ....

Different Approaches used in load balancing :Two different form have been taken by researchers in their attempts to achieve load balance in distributed systems are  Static  Dynamic 14 .

A deterministic strategy assigns tasks to processors based on a fixed criterion. 15 .Static Load balancing :The Static approach further divide into two categories  Deterministic .  Probabilistic .A probabilistic strategy uses probability values when the assignment is made.

Dynamic Load Balancing : well known strategies are  Bidding  Drifting  Threshold  Greedy 16 .

Mathematics 17 .Scope of Project Load balancing in parallel computing has been considered to be "the high end of computing". and has been used to model difficult scientific and engineering problems found in the real world . Few of them are y Computer Science.

**THANKS TO ALL OF YOU** 18 .