How does the automatic garbage collection mechanism work in the memory management system?

In Go, the automatic garbage collection (GC) mechanism is based on a reachability tracing algorithm. When a program allocates memory for objects, the garbage collector periodically runs to determine which objects are no longer reachable from root points (such as global variables, goroutine stacks).

GC in Go operates concurrently with the program execution, minimizing pauses. It uses three main phases:

1. Marking — the collector marks all objects reachable from the roots.
2. Sweeping — memory occupied by unmarked (unreachable) objects is freed.
3. Compaction — in Go, memory compaction is not applied, as it uses a generational algorithm and fragmentation is managed differently.

Here's a simplified example of a GC cycle:

// Example of implicit GC usage
func main() {
    data := make([]byte, 1024*1024) // allocate 1MB
    _ = data
    // When data is no longer used, GC will automatically free the memory
}

Thus, developers do not manually manage memory; GC provides automatic cleanup of unused objects, reducing the risk of memory leaks.