Editing Load balancing (computing) (section)

====Adaptation to larger architectures (scalability)====
In the context of algorithms that run over the very long term (servers, cloud...), the computer architecture evolves over time. However, it is preferable not to have to design a new algorithm each time.

An extremely important parameter of a load balancing algorithm is therefore its ability to adapt to scalable hardware architecture. This is called the [[scalability]] of the algorithm. An algorithm is called scalable for an input parameter when its performance remains relatively independent of the size of that parameter.

When the algorithm is capable of adapting to a varying number of computing units, but the number of computing units must be fixed before execution, it is called moldable. If, on the other hand, the algorithm is capable of dealing with a fluctuating amount of processors during its execution, the algorithm is said to be malleable. Most load balancing algorithms are at least moldable.<ref>{{cite book |last1=Asghar |first1=Sajjad |last2=Aubanel |first2=Eric |last3=Bremner |first3=David |title=2013 42nd International Conference on Parallel Processing |chapter=A Dynamic Moldable Job Scheduling Based Parallel SAT Solver |date=October 2013 |pages=110–119 |doi=10.1109/ICPP.2013.20 |isbn=978-0-7695-5117-3 |s2cid=15124201 }}</ref>