3 ms·
Distributed algorithms that have to tolerate random machine failure and network partitions are incomparably harder than either of those.
by haberman 17y ago
Distributed algorithms that have to tolerate random machine failure and network partitions are incomparably harder than either of those.
- Periodic 17y agoI'm pretty sure that quote is a bit old. It's definitely true that one of the largest problems facing computer science today is how to parallelize across cores/systems/networks. This problem may only be particularly hard because we're still used to thinking in terms of discrete processors each doing discrete tasks in sequence.
- holygoat 17y agoIt's also somewhat tongue in cheek.