TY - CHAP
T1 - On the Optimization of Load Balancing in Distributed Networks in the Presence of Delay
AU - Dhakal, Sagar
AU - Hayat, Majeed M.
AU - Ghanem, Jean
AU - Abdallah, Chaouki T.
AU - Jerez, Henry
AU - Chiasson, John
AU - Birdwell, J. Douglas
PY - 2005
Y1 - 2005
N2 - Distributing the total computational load across available processors is referred to as load balancing in the literature. A typical distributed system consists of a cluster of physically or virtually distant and independent computational elements (CEs), which are linked to one another by some communication medium. The workload has to be distributed over all the available CEs in proportion to their processing speed and availability such that the overall work completion time is minimized. In most practical distributed systems, due to the unknown character of the incoming workload, the nodes exhibit non-deterministic run-time performance. Thus, it is advantageous to perform the load balancing periodically during a run-time so that the run-time variability is minimized. This is referred to in the literature as dynamic load balancing [1]. However, the frequent load balancing requires the periodic communication (and transfer of loads, of course) between the CEs so that the shared knowledge of the load state of the system can be used by individual CEs to judiciously assign an appropriate fraction of the incoming loads to less busy CEs according to some load-balancing policy.
AB - Distributing the total computational load across available processors is referred to as load balancing in the literature. A typical distributed system consists of a cluster of physically or virtually distant and independent computational elements (CEs), which are linked to one another by some communication medium. The workload has to be distributed over all the available CEs in proportion to their processing speed and availability such that the overall work completion time is minimized. In most practical distributed systems, due to the unknown character of the incoming workload, the nodes exhibit non-deterministic run-time performance. Thus, it is advantageous to perform the load balancing periodically during a run-time so that the run-time variability is minimized. This is referred to in the literature as dynamic load balancing [1]. However, the frequent load balancing requires the periodic communication (and transfer of loads, of course) between the CEs so that the shared knowledge of the load state of the system can be used by individual CEs to judiciously assign an appropriate fraction of the incoming loads to less busy CEs according to some load-balancing policy.
UR - http://www.scopus.com/inward/record.url?scp=84880031060&partnerID=8YFLogxK
M3 - Chapter
AN - SCOPUS:84880031060
SN - 3540228195
SN - 9783540228196
T3 - Lecture Notes in Control and Information Sciences
SP - 223
EP - 244
BT - Advances in Communication Control Networks
A2 - Tarbouriech, Sophie
A2 - Abdallah, Chaouki
A2 - Chiasson, John
ER -