3 ms·
> Who by the way runs applications on a 88 core server, why would you so they instead of splitting that into smaller chunks. Graph analysis and/or routing, for
by derefr 8y ago
> Who by the way runs applications on a 88 core server, why would you so they instead of splitting that into smaller chunks.
Graph analysis and/or routing, for one. Distributed Dijkstra is pretty impractical (the optimal lower bound on the number of messages required equals the number of edges in the graph!)
For example, I don't work for Google, but I can pretty much guarantee you that an individual Google Maps routing query runs on a single, extremely-high-memory (but not NUMA!) node, which has likely been optimized for speed using plain-old threading on a high-core-count CPU, with the upper bound on the number of useful cores being the system architecture's per-socket memory bandwidth.
- foobiekr 8y agoI would be very, very curious if this is actually true. I agree with the intuition behind the statement but I am actually curious how it is done.
- Thaxll 8y agoI highly doubt Google runs any workload on Borg with CPU count > 24. I don't work there, so I'm just assuming but it goes against all modern scaling / deployments patterns.
- shereadsthenews 8y agoThere are various workloads that occupy entire machines, they are all very carefully written by dedicated performance experts, in C++.
- kasey_junk 8y agoWhere do you get high core count computers that aren’t numa?
- jefftk 8y agoI think you're ignoring caching/preprocessing in your analysis.
- derefr 8y agoI am, yeah; but it’s an infinite regress—if these aren’t the specs of the machine that answers your query, then they’re the specs of the machine that does the spec-work to build the cache.
- erik_seaberg 8y agoOr the machine that designs the machine that answers your query.