How does `sync.Pool` avoid lock contention across 64 CPU cores, why did Go 1.13 add a 'victim cache' to `sync.Pool`, and how do you combine `sync.Pool` and.

A strong answer

A strong candidate frames How does sync.Pool avoid lock contention across 64 CPU cores, why did Go 1.13 add a 'victim cache' to sync.Pool, and how do you combine sync.Pool and. around the exact memory layout, compiler semantics, and hardware execution model covered in [sync.Mutex Starvation Mode, Per-P sync.Pool, and Singleflight Stampede Control]. Explain per-P poolLocal private slots + lock-free poolChain ring buffers, the 2-GC-cycle victim cache that smooths allocation spikes after GC, and singleflight context detachment.

Your hot cache key 'homepage_feed' expires at 12:00:00.000. In the next 20 milliseconds, 5,000 concurrent HTTP requests all miss the cache simultaneously and fire 5,000 identical heavy SQL queries at your primary database (a cache stampede / thundering herd), taking the database offline! Meanwhile, each request allocates a new 64 KB bytes.Buffer for JSON serialization, triggering a garbage collection cycle every 80 milliseconds.

When engineers encounter this bottleneck in production, a surface-level API description rarely explains what went wrong. In real workloads, every line of code executes against concrete hardware constraints: fixed-width memory cells, CPU cache lines, kernel descriptor tables, network socket buffers, or accelerator memory buses. Without a clear mental model of Go sync.Mutex starvation handoff, per-P sync.Pool, and singleflight request coalescing, debugging degrades into guesswork—tuning timeouts, adding retries, or scaling instances blindly while the underlying architectural flaw remains untouched.

In a production interview, always connect the specification rule to its concrete runtime consequence: state what lives on the stack versus the heap or static storage segment, how the compiler or operating system validates alignments, lifetimes, and error codes, and what happens under adversarial or boundary inputs (such as zero-length buffers, integer overflow, concurrent mutation, or partial I/O). Backing your explanation with a small trace of register/memory state transitions immediately separates senior systems engineers from candidates who only memorized syntax.

What the interviewer is listening for

• Mastery of core invariant: Trace sync.Mutex's transition from high-throughput normal spinning mode to 1-ms FIFO starvation mode.
• Mastery of core invariant: Recycle temporary buffers lock-free per P using sync.Pool with Reset() and max-capacity guards.
• Mastery of core invariant: Prevent cache-stampede database outages using singleflight.Group and detached request contexts.
• Hardware and ABI awareness: Explaining how sizes, alignments, calling conventions, or kernel boundaries behave on real 64-bit targets rather than relying on implementation-defined assumptions.
• Defensive engineering: Naming the exact compiler flags (-Wall -Wextra -Werror), static analyzers, or runtime sanitizers (-fsanitize=address,undefined,thread) that verify correctness in CI.

Common mistakes

• Explaining only surface syntax without tracing the underlying memory addresses, ownership lifetime, or kernel/user-space state transitions.
• Assuming undefined behavior (such as signed overflow, uninitialized reads, strict-aliasing violations, or dangling pointers) will "just work" because it passed an unoptimized -O0 debug build.
• Ignoring return codes, partial reads/writes, alignment padding, or cleanup paths when an allocation or syscall fails midway through a function.