2. Load Distributing Algorithm: Some load distribution algorithms are Sender Initiated algorithms Receiver Initiated algorithms Symmetrically Initiated algorithms - THE ABOVE AVERAGE ALGORITHM Adaptive algorithms

3. Sender Initiated algorithm: In this algorithms, load distribution activity is initiated by an overloaded node i.e sender that attempts to send a task to an underloaded node i.e receiver.

4. Receiver-Initiated algorithms: In this algorithms, the load distributing activity is initiated from an underloaded node i.e receiver that is trying to obtain a task from an overloaded node i.e sender.

5. Symmetrically Initiated algorithms: In this algorithm, both senders and receivers search for receivers and senders for task transfers. So these algorithms have the advantages of both sender initiated and receiver initiated algorithms. If the system load is low, the sender initiated component is more successful in finding underloaded nodes. If the system load is high, the receiver initiated component is more successful in finding overloaded nodes.

6. Disadvantages: However these symmetrically initiated algorithms are not immune from the disadvantages of sender and receiver initiated algorithms. In sender initiated algorithm, task sending at high system loads leads to system instability. In receiver initiated algorithm, a preemptive task transfer facility is necessary.

7. THE ABOVE AVERAGE ALGORITHM: This is used to maintain the load at each node within an acceptable range of the system average. Maintaining the load at each node at the exact system average, it leads to processor thrashing.

8. Description of the algorithm is as follows: There are 4 policies Transfer policy Location policy Selection policy Information policy

9. Transfer policy: The transfer policy is a threshold policy that uses two adaptive thresholds. These thresholds are equidistant from the node of the average load across all nodes.

10. Location policy: There are two components in location policy. Sender initiated component Receiver initiated component

11. Sender Initiated component: A sender broadcasts a TooHigh message, sets a TooHigh timeout alarm, and waits for the Accept message. The receiver that receives a TooHigh message cancels its TooLow timeout sends an Accept message to the sender and increases its load value and sets an AwaitingTask timeout. Increasing its load value prevents a receiver from over committing itself to accepting remote tasks.

12. On receiving the Accept message, if the node is still a sender, it chooses the best task to transfer and transfers it to the receiver who sends Accept message. On receiving a TooLow message, it sends a TooHigh message to the node which sends TooLow message. If sender does not get accept message within its TooHigh timeout, then the sender estimates that the average system load is too low. Then the sender broadcast a ChangeAverage message to increase the average load estimated to the other nodes.

13. Receiver Initiated component: The receiver node broadcasts a TooLow message, sets a TooLow timeout alarm and waits for the TooHigh message. If a TooHigh message is received, the receiver performs the same actions that it does under sender initiated component. If the TooLow timeout expires before receiving any TooHigh messages, the receivers broadcasts a ChangeAverage message to decrease the average load estimate at the other nodes.

14. Selection policy: A selection policy selects a task for transfer, once the transfer policy decides that the node is a sender. If the selection policy fails to find a suitable task to transfer, the node is no longer considered as sender a sender, until the transfer policy decides that the node is sender again.

15. Information policy: The highlight of this algorithm is the average system load is determined for each node. When the communication network is heavily/lightly loaded, the acceptance range can be increased/decreased by each node.

16. Thank You