Universal Scalability Law: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
|||
| (2 intermediate revisions by the same user not shown) | |||
| Line 8: | Line 8: | ||
* [[Software Architecture#Subjects|Software Architecture]] | * [[Software Architecture#Subjects|Software Architecture]] | ||
* [[Reactive Programming]] | * [[Reactive Programming]] | ||
* [[Amdahl's Law]] | |||
=Overview= | =Overview= | ||
Pushing utilization beyond a certain point will yield diminishing or even negative returns. This observation was formalized by Neil J. Guther as Universal Scalability Law (USL). | Pushing utilization beyond a certain point will yield diminishing or even negative returns. This observation was formalized by Neil J. Guther as Universal Scalability Law (USL). | ||
USL introduces the cost of communication - coherency, or the cost of keeping data in sync - as a variable in the equation. | |||
Latest revision as of 04:16, 31 December 2023
External
- Neil J. Gunther, “A Simple Capacity Model of Massively Parallel Transaction Systems,” proceedings of CMG National Conference (1993) http://www.perfdynamics.com/Papers/njgCMG93.pdf
- Baron Schwartz, "Practical Scalability Analysis with the Universal Scalability Law" https://www.vividcortex.com/resources/universal-scalability-law/
Internal
Overview
Pushing utilization beyond a certain point will yield diminishing or even negative returns. This observation was formalized by Neil J. Guther as Universal Scalability Law (USL).
USL introduces the cost of communication - coherency, or the cost of keeping data in sync - as a variable in the equation.