3 ms·
It's based on the assumption that node and network failures can be detected (with a performance cost) and unobservably healed around. It's also assuming that t
by JonChesterfield 4y ago
It's based on the assumption that node and network failures can be detected (with a performance cost) and unobservably healed around.
It's also assuming that the runtime can make a good enough guess at when the ratio of data size to compute time for a task makes distribution profitable.
Distributed systems programming is indeed hard. That's why I want it pushed out of my applications.
- goodpoint 4y ago> It's based on the assumption that node and network failures can be detected (with a performance cost) and unobservably healed around. ...which is false, especially on large scale systems. Unmanaged cascading failures are the kind of thing that caused big downtimes in various FAANGs many times. > Distributed systems programming is indeed hard. That's why I want it pushed out of my applications. Companies hire good software and system engineers to do this stuff.