3 ms·
What is the class of problem that can be solved by computers of a certain size (compute density metric)? If a computer is basically instantaneous, but has to co
by sitkack 7y ago
What is the class of problem that can be solved by computers of a certain size (compute density metric)? If a computer is basically instantaneous, but has to communicate over vast distances, it still couldn't solve large problems.
Couldn't we have already made 100k core single image OSs running over RDMA?
- throwaway_pdp09 7y agoI don't think @rbanffy is claiming such a class of problems exist. I certainly didn't read it that way.
- sitkack 7y ago@rbanffy might know if they do.
- rbanffy 7y agoI'm sure that, as we extend the capabilities of our machines, we'll find new problems or approaches to known problems that were not practical up until then. Like I mentioned, this can increase bandwidth and reduce latency between system components, making warehouse-sized computers look like container-sized ones. I bet we can find some use for that.