Load balancing (computing): Difference between revisions

Revision as of 00:57, 20 September 2024

Revision as of 21:58, 25 November 2024

Line 2:

[[File:Elasticsearch Cluster August 2014.png|thumb|Diagram illustrating user requests to an [[Elasticsearch]] cluster being distributed by a load balancer. (Example for [[Wikipedia]].)]]

In [[computing]], '''load balancing''' is the process of distributing a set of [[Task (computing)|tasks]] over a set of [[System resource|resources]] (computing units), with the aim of making their overall processing more efficient. Load balancing can optimize response time and avoid unevenly overloading some compute nodes while other compute nodes are left idle.

Load balancing is the subject of research in the field of [[parallel computers]]. Two main approaches exist: static algorithms, which do not take into account the state of the different machines, and dynamic algorithms, which are usually more general and more efficient but require exchanges of information between the different computing units, at the risk of a loss of efficiency.