3 ms·
Because we continuously reuse use a fairly limited number of patterns we get to optimize the hell out of them. At a generic level, not specific implementations,
by klageveen 8y ago
Because we continuously reuse use a fairly limited number of patterns we get to optimize the hell out of them. At a generic level, not specific implementations, but you can still make them fast.
There are some other mitigating factors, like:
- the datastore is fully in memory
- you can spin up multiple datastores to share the load
You also don't tend to accidentally run into a performance issue. The constructions that cost more (e.g. nested derived collections) or are risky (kicking of derivations at a high interval) are known beforehand. You tend to know already if you're going to use a lot of memory or expect high CPU load.
- someguydave 8y agoBut you are releasing the server binaries for people to run on arbitrary hardware. Surely different CPUs and machine profiles move the performance thresholds on various dataflow implementations?