How does the Garbage Collector interact with data structures? (Weak references, Gen0/Gen1/Gen2)
Garbage Collection and Data Structures
Garbage collectors reclaim objects that are no longer reachable from GC roots. Data structures directly influence allocation rate, object graph size, locality, and collection cost. In generational collectors, newly allocated objects typically start in a young generation and surviving objects may be promoted to older generations. Weak references allow a reference to an object without preventing collection when the object is otherwise unreachable.
- 1
GC roots include active stacks, static references, and runtime-managed roots.
- 2
Gen0/young generation generally contains short-lived allocations.
- 3
Surviving objects can be promoted to older generations.
- 4
Large or long-lived data structures can increase GC pressure.
- 5
Weak references are useful for caches and metadata where retention should not prevent collection.
- 6
Exact generation terminology and behavior depend on the runtime and garbage collector.
Follow-up Questions
- What is the difference between weak and strong references?
- Why can object-heavy data structures increase GC pressure?