4 ms·
I don't think that's a fair summary. Stateful cells have non-local and non-commutative evolution, which is why they're hard to distribute. These frameworks elim
by naasking 10y ago
I don't think that's a fair summary. Stateful cells have non-local and non-commutative evolution, which is why they're hard to distribute. These frameworks eliminate the non-locality, which isn't negotiable if you want to scale, but at the expense of preserving the requirement that you manually ensure commutativity.
Not a bad tradeoff, and I highly recommend the CR papers if you haven't read them. I'd say most programs have a natural expression in terms of revisions, and you're left with only a small set of circumstances where state simply must evolve consistently and atomically (airplane seat reservations, for instance).
I would still like a framework for reasoning about these circumstances that integrates naturally with CR though.
- jacques_chester 10y agoI hear you, I do. But it irks me when people wave this stuff around like a magic wand, because it's just not. It's like saying you have an O(1) solution to all TSP graphs with the teeny, tiny caveat that you start with a solution to the TSP graph you're working on.
- naasking 10y agoI still think your last statement is unfair. At worst, the caveat is that the TSP solution is for any graph within a certain class of topologies. Concurrent revisions in particular has been implemented to work in concurrent, parallel and incremental computing, with no change in semantics. So it's pretty darn close to a magic wand, but it can't violate the laws of logic.