4 ms·
Cliff Click communicates telegraphically: He mentions GC, so you can immediately update the statement with "operating on a larger than memory data sets" as that
by eternalban 15y ago
Cliff Click communicates telegraphically: He mentions GC, so you can immediately update the statement with "operating on a larger than memory data sets" as that is when you need GC. Obviously basic concurrency primitives will allow trivial concurrent code if a fixed set of memmory pages are simply allocated and then assigned a fix isolation level e.g. via a allocation of a large array that fits in L3 and is forever resident.
However if the data set is constantly changing, because either you are churning through a lot of short lived memory objects or you have structures e.g. trees spanning a very large number of pages, then you have a memory management problem to address. Either way you are constantly blowing your L2 (and possibly L3) caches. Naturally, limiting those page swaps is the key to high performance. Concurrency exacerbates this demand (which is present even for single threaded servers) by placing isolation requirements on pages and data. So the name of the game is memory page management, e.g. "GC" in Dr. Click speak. His choice of telegraphic word is also highly informed: he is nailing the fact that removal of garbage is basically what the allocators all must struggle with and that the GC makes or breaks the allocator (for such high performance systems).
So I would flip Click's pithy statement and state verbosely:
High performance concurrent computing's requirement for data locality and isolation inevitably require very sophisticated memory allocation and memory pool management sub-systems. And beyond simple but effective heuristics such as object creation time (for locality) any further significant gains to be had can only be delivered by the garbage collection mechanisms of the memory manager.