Re:Practices for writing high-performance Go
by kasey_junk on Monday May 06, 2019 @05:41PM
(#19844197)
Where do you get high core count computers that aren’t numa?
I 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.
Re:Practices for writing high-performance Go
by shereadsthenews on Monday May 06, 2019 @05:31PM
(#19844099)
There are various workloads that occupy entire machines, they are all very carefully written by dedicated performance experts, in C++.
Re:Practices for writing high-performance Go
by foobiekr on Monday May 06, 2019 @02:20PM
(#19842223)
I 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.
I think you're ignoring caching/preprocessing in your analysis.
I 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.
Re:Practices for writing high-performance Go
by erik_seaberg on Tuesday May 07, 2019 @12:48PM
(#19851163)
Or the machine that designs the machine that answers your query.
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.