释义 |
DictionarySeeclusteringload balancing
load balancing (operating system, parallel)Techniques which aim to spreadtasks among the processors in a parallel processor to avoidsome processors being idle while others have tasks queueingfor execution. Load balancing may be performed either byheavily loaded processors (with many tasks in their queues)sending tasks to other processors; by idle processorsrequesting work from others; by some centralised taskdistribution mechanism; or some combination of these. Somesystems allow tasks to be moved after they have startedexecuting ("task migration") others do not. It is importantthat the overhead of executing the load balancingalgorithm does not contribute significantly to the overallprocessing or communications load.
Distributed scheduling algorithms may be static, dynamic orpreemptive. Static algorithms allocate processes toprocessors at run time while taking no account of currentnetwork load. Dynamic algorithms are more flexible, thoughmore computationally expensive, and give some consideration tothe network load before allocating the new process to aprocessor. Preemptive algorithms are more expensive andflexible still, and may migrate running processes from onehost to another if deemed beneficial. Research to dateindicates that dynamic algorithms yield significantperformance benefits, but that further (though lesser) gainsmay be had through the addition of process migrationfacilities.load balancingThe pre-stressing of a beam or slab so that it is subject to zero bending movement under its service load.load balancingThe even distribution of processing across available resources such as servers in a network or disks in a storage area network (SAN). Load balancing might split incoming transactions evenly to all servers, or it may redirect transactions to the next available server as needed. See clustering.AcronymsSeelog book |