| Leader election on top of Scuttlebutt. | |
| ----------------------------------------------- | |
| The following makes it possible to cheaply get a leader election | |
| on top of a Cassandra-like membership using scuttlebutt + phi accrual detection. | |
| # TDLR about Scuttlebutt and phi accrual detection | |
| Scuttlebutt is a anti-entropy gossip algorithm. | |
| It makes it possible for every node in a cluster to |
A traditional table-based DFA implementation looks like this:
uint8_t table[NUM_STATES][256]
uint8_t run(const uint8_t *start, const uint8_t *end, uint8_t state) {
for (const uint8_t *s = start; s != end; s++)
state = table[state][*s];
return state;
}
