News for hackers. Stuff that matters.
Re:Practices for writing high-performance Go by Thaxll on Monday May 06, 2019 @01:01PM (#19841365)
You're talking a about a very specific scenario, out of the box Go is off course easier than C++ for concurrency. Who by the way runs applications on a 88 core server, why would you so they instead of splitting that into smaller chunks.
Re:Practices for writing high-performance Go by derefr on Monday May 06, 2019 @01:25PM (#19841656)
> 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.

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?
Re:Practices for writing high-performance Go by Thaxll on Monday May 06, 2019 @03:02PM (#19842617)
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.
Re:Practices for writing high-performance Go by jefftk on Monday May 06, 2019 @10:25PM (#19845874)
I think you're ignoring caching/preprocessing in your analysis.
Re:Practices for writing high-performance Go by derefr on Tuesday May 07, 2019 @10:02AM (#19849388)
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.
Re:Practices for writing high-performance Go by nickpsecurity on Tuesday May 07, 2019 @11:20AM (#19850307)
Anyone doing scale up in the HPC space. It's a massive market. This link has a picture in it showing the industries that buy that stuff:

https://www.nextplatform.com/2017/06/22/casing-hpc-market-ha...

Although they cost a ton, there were at least two reasons to like NUMA machines:

1. You program them much like multithreaded machines instead of message passing like MPI. You do need to account for locality. There's OS, library, and documentation support for handling that, though. Porting a multithreaded library to NUMA is much smaller problem than clustering it.

2. A massive amount of memory with lower-latency access than on clusters. If your data is in memory, it's much faster than if it's being moved in and out of memory. Then, when it is moved, it's moved faster. Low-latency reduces the damage of many smaller copies, too.

For such reasons, I always wanted a SGI or Cray machine. Modern, multi-core machines with plenty of RAM are good enough for most of my purposes, though. I do plan to do some model-checking of software in the near future. The amount of RAM used grows exponentially or something like that with the size of the program. Small ones already use GB of RAM in the analyses. Some are getting parallelized a bit. Obviously, 88 cores with 100+GB of RAM could be pretty useful if handling programs twice or three times as large. :)

Btw, there are also languages designed specifically to take advantage of parallelism in many HPC situations. Like Go, they were intended to let you describe the algorithms in a high-level way with the compiler synthesizing efficient implementations for everything from multi-cores to NUMA to clusters. That's the theory. The best one from my prior research was Chapel. Then, there's simpler ones for stuff like data parallel with Cilk being an example.

https://chapel-lang.org/

https://en.wikipedia.org/wiki/Cilk

ParaSail was a recent one with interesting design. I'm not sure what its current status is in terms of usability.

https://www.embedded.com/design/programming-languages-and-to...

Re:Practices for writing high-performance Go by shereadsthenews on Monday May 06, 2019 @01:16PM (#19841564)
You're making a different argument, that one does not need so much vertical scalability, and I might agree, but that doesn't negate the fact that Go has limits of vertical scalability that C++ doesn't face.
Re:Practices for writing high-performance Go by weberc2 on Tuesday May 07, 2019 @09:17AM (#19849035)
The original claim was that concurrency is easier in Go, not that Go has a higher performance ceiling. You are the one making the different argument. :)