May 28, 2026 · 35 min · 9 segments
Java's use of memory, often chided for being excessive, is actually a strength as it trades more memory use for fewer CPU cycles. Java can only make this tradeoff due to its moving garbage collectors…
Ron PresslerGuest
Nicolai ParlogHost
A- anyway, to, to your question, uh, the, the reason it's not a cope is because...

Well, first of all, my talk is, is not about, uh, how a specific GC in the JDK works, but about the principles behind all of them.

And the obvious reason it's not a cope is because that general algorithm, which is called, um, moving collectors, moving garbage collectors, was invented, uh, to reduce the overhead of less efficient, uh, memory management techniques-

... that we see in many other languages, including anything that space and malloc can free.

Um, and I think that the person who first identified the, uh, the efficiency of moving collectors is Andrew Appel at Princeton, uh, in the '80s in a paper called, um, Garbage Collecting can, uh, Garbage Collection Can Be Faster Than, um, Stack Allocation.

W- because w- we don't have infinite memory, and we have to reuse memory, uh, for new objects in, to replace old ones.


Uh, and the moving algorithm was created to reduce the overhead of memory management.

We had the, uh, CMS collector, which is, uh, very similar to the collector u- that's used by Go now.

Uh, we removed it from the JDK I think six years ago just because the other approach was better.


And CMS was more like, let's concurrent mark sweep, let's do it in concurrency with the application.

A- anyway, to, to your question, uh, the, the reason it's not a cope is because...

Well, first of all, my talk is, is not about, uh, how a specific GC in the JDK works, but about the principles behind all of them.

And the obvious reason it's not a cope is because that general algorithm, which is called, um, moving collectors, moving garbage collectors, was invented, uh, to reduce the overhead of less efficient, uh, memory management techniques-

... that we see in many other languages, including anything that space and malloc can free.

Um, and I think that the person who first identified the, uh, the efficiency of moving collectors is Andrew Appel at Princeton, uh, in the '80s in a paper called, um, Garbage Collecting can, uh, Garbage Collection Can Be Faster Than, um, Stack Allocation.

W- because w- we don't have infinite memory, and we have to reuse memory, uh, for new objects in, to replace old ones.


Uh, and the moving algorithm was created to reduce the overhead of memory management.

We had the, uh, CMS collector, which is, uh, very similar to the collector u- that's used by Go now.

Uh, we removed it from the JDK I think six years ago just because the other approach was better.


And CMS was more like, let's concurrent mark sweep, let's do it in concurrency with the application.
The rest of this transcript — segmented and speaker-labeled, so you land on the exact moment something was said
Search every transcript — by keyword, by phrase, or by meaning, across every show Radar indexes
Trends — what is surging across podcasts, measured against its own baseline
Alerts — when a name you follow appears in a newly indexed episode
No account is needed to search Radar.