Applying Laws of Scalability to Technology and People

Amdhal’s Law

Speed up (P, N) = 1 / [ (1 — P) + P / N ]

N / [ 1 + α (N — 1) ]

The theoretical speedup of the latency of the execution of a program (credit wikipedia).

Brooks’s Law

Number of communication channels = N x (N - 1) / 2

Universal Scalability Law

C(N) = N / [1 + α(N — 1) + βN (N — 1) ]

Little’s Law

L = λ W

WIP = Throughput x Lead-Time
Lead-Time = WIP / Throughput

King’s formula

(credit wikipedia)

Gustafson’s Law

S = s + p x N
S = (1 — s) x N
S = N + (1 — N) x s

Conway’s Law

Pareto Principle

Metcalfe’s Law

Number of possible pair connections = N * (N — 1) / 2

Number of possible subgroups of a network = 2^NN − 1

Dunbar Number

Summary

--

--

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store