[go: up one dir, main page]
Scribd
Upload
238 views1 page

Components of Load Distributing Algorithm

The document outlines the key components of a load distributing algorithm: the transfer policy which determines when a node should transfer tasks based on thresholds, the selection policy which determines which tasks to transfer based on factors like size and system calls, the location policy which determines the receiving node through polling, and the information policy which determines how system state is collected to inform the other policies.

Uploaded by

Nisha Joseph
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
238 views1 page

Components of Load Distributing Algorithm

The document outlines the key components of a load distributing algorithm: the transfer policy which determines when a node should transfer tasks based on thresholds, the selection policy which determines which tasks to transfer based on factors like size and system calls, the location policy which determines the receiving node through polling, and the information policy which determines how system state is collected to inform the other policies.

Uploaded by

Nisha Joseph
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

COMPONENTS OF LOAD DISTRIBUTING ALGORITHM

Transfer policy: to decide whether a node needs to transfer tasks.

Thresholds, perhaps in terms of number of tasks, are generally used. (Another


threshold can be processor utilization).

When a load on a node exceeds a threshold T, the node becomes a sender. When
it falls below a threshold, it becomes a receiver.

Selection Policy: to decide which task is to be transferred.

Criteria: task transfer should lead to reduced response time, i.e., transfer overhead
should be worth incurring.

Simplest approach: select newly originated tasks. Transfer costs lower as no state
information is to be transferred. Non-preemptive transfers.

Other factors for selection: smaller tasks have less overhead. Location-dependent
system calls minimal (else, messages need to be exchanged to perform system
calls at the original node).

Location Policy: to decide the receiving node for a task.

Polling is generally used. A node polls/checks whether another is suitable and


willing.

Polling can be done serially or in parallel (using multicast).

Alternative: broadcasting a query, sort of invitation to share load.

Information policy: for collecting system state information. The collected information is
used by transfer, selection, and location.

Demand-driven Collection: Only when a node is highly or lightly loaded, i.e.,


when a node becomes a potential sender or receiver.

Can be sender-initiated, receiver-initiated, or both(symmetric).

Periodic: May not be adaptive. Collection may be done at high loads worsening
system performance.

State-change driven: only when state changes by a certain degree.

You might also like