3 ms·
The general purpose answer to that question is OLTP. The transaction processing community has a number of benchmarks which look at the cost per transaction and
by ChuckMcM 11y ago
The general purpose answer to that question is OLTP. The transaction processing community has a number of benchmarks which look at the cost per transaction and large mainframes typically "win" in those scenarios. As for why they win, that is an interesting question.
As a systems enthusiast and someone who has watched as computers got small and then big and then small and then big again, I believe the fundamental answer is based in state machine theory. Specifically around how data becomes "entangled" with other data. That is the essence of what makes transactions hard.
I first ran into this looking at scaling file systems. Unlike RAID where all of the blocks in a stripe are related mathematically, a "file" as a sequence of octets is defined not only by the mutations that happen to it, but the order in which those mutations take place. So "append 1, 2, 3", back up one, append 4, 5" leaves 1, 2, 4, 5 if applied in sequence but leaves 1, 2, 3, 4 if the last two steps are swapped. Thus both operations and the order of the operations are important. To hold the state of a complex sequence stable, you generally have to have it all in memory ready to complete (commit) and then rapidly verify its stable, and then commit it.
Clusters of smaller systems have a hard problem with this. That said, I would love to play with some of Google's spanner systems to see how well they handle the OLTP workload with respect to cost/size/power. The paper suggests that there is a credible path there as flocks of distributed systems get cheaper and more easily connected.
- etrain 11y agoSpanner maxes out at ~10 transaction (batches)/second in that paper. By comparison, a standard PostgresSQL installation (on littleish iron) is capable of 50k TPS depending on the benchmark you're running. In the Spanner design the maximum throughput is governed by the accuracy of GPS and atomic clocks and, ultimately, the speed of light. You can only make 7 round-trips per second between a data center in New York and on in Singapore unless you're willing to bore a hole through the center of the earth. Order is expensive and, more fundamentally, coordination is expensive. At the center of traditional OLTP workloads is a promise given by the system to the developers that their transactions will happen in some order. Peter Bailis and Joe Hellerstein are two prominent academics working on addressing this problem, and at the core of their research is giving up pieces of this promise.
- tedunangst 11y agoThis comment made a lot more sense after I realized it wasn't talking about one laptop per child, but for a while that interpretation was almost working.