Also known as a Fermi Approximation - one of the most useful tools any engineer, scientist, manager, mathematician or programmer can have.
(In a pinch, napkins will suffice. ;-)
Q: You guys can pay 10,000 people in 8 hours. To do the hourly payroll you'll have to do 10 times that many in the same time. Why do you think you can do it?
A: GemStone 5.x is supposed to be 4 times faster than the version we use now, and we're assuming we'll get only a factor of 2. We did an experiment a while back paying on 5 CPUs instead of 1. It went five times faster. We have 12 CPUs available on the machine, and we're assuming we'll get only a factor of 8. GemStone 5 plus paying in parallel should give us a factor of at least 16 in performance. We only need 10. That's why we're not worried.
The BigDesignUpFront consultant and several inexperienced coders were killing the project with complex multi-threaded architecture, application-defined locking schemes, signals between processes, etc. "What volume are you expecting?" I asked, and "how large are your transactions?" "Lots and lots" they said. "You just have no idea how much work we'll be doing!!!" they said. So I looked at their transactions and counted their customers: A few hundred lines per transaction, with relatively simple processing. Several thousand customers, but with work process rules that limit when and how they can gather (and hence send us) the data. Result: Roughly one transaction every three minutes, with no reason to believe there will be significant "peak periods" of high load. "I think Oracle can handle that," I said.
(Now to kill the multi-threading, synchronization, background processing, and other hairy nonsense that was shoveled in...)
The great mathematician Stanislaw Ulam recounted that the tables of the (Scottish) café in Lvov (Ukraine) had marble tops, so they could write in pencil, directly on the table, during their discussions.
See http://encyclopedia.thefreedictionary.com/Scottish%20Caf%E9