3 ms·
Heh, yes, very much that. My sole contribution to HPC was inventing a graph algorithm (circa 2009) for breadth-first search that didn't require the usual itera
by jandrewrogers 10y ago
Heh, yes, very much that.
My sole contribution to HPC was inventing a graph algorithm (circa 2009) for breadth-first search that didn't require the usual iterated barrier synchronization super-step you have with BSP algorithms. Instead, every node would run free with almost no synchronization but a clever error correction mechanism backed out all the incorrect traversals for a completely negligible cost (both space and time) relative to the ability to let the computation run as though it was embarrassingly parallel. It basically allowed every node to always be doing (mostly) constructive work without waiting on another node.
But yeah, burning a bit of CPU to eliminate synchronization is frequently a huge win. This is where knowing how much compute you can do within a given latency window is helpful.
- adrianN 10y agoDo you have a citation for that?