3 ms·
It is O(n log n) like any kind of communication. Higher constant factor can kill you too. See Erlang and theorems also proven for clique networks.
by AstralStorm 9y ago
It is O(n log n) like any kind of communication. Higher constant factor can kill you too.
See Erlang and theorems also proven for clique networks.
- quadcore 9y agoI was referring to productivity, not network communication. an O(1) pain in the ass as pg wrote.
- AstralStorm 9y agoDeveloper communication, deployment complexity... more entities, more overhead.