How much faster can it get?
Adding people, machines or processors only speeds up the part of the work that can be shared. The rest sets a hard ceiling. This works the same for a computer program, a kitchen or a report that needs one sign-off.
–faster than one worker
–the ceiling, with unlimited workers
–of each worker’s time well used
How it works
This is Amdahl’s law. If a share p of the work can be split across n workers, the time drops from 1 to (1 − p) + p / n, so the speed-up is 1 / ((1 − p) + p / n). As n grows, p / n vanishes and the speed-up approaches 1 / (1 − p). It assumes the split is free; in practice coordination costs make things a little worse.
Runs entirely in your browser. Nothing you enter is sent anywhere.