How does a fiber mutex avoid blocking the OS thread?

A strong answer

A strong candidate frames How does a fiber mutex avoid blocking the OS thread? around the exact memory layout, compiler semantics, and hardware execution model covered in Cooperative Synchronization: Fiber Mutexes, Semaphores, and Channels. Explain yielding the fiber (not the thread) and switching to another ready fiber, keeping the OS thread busy.

In Lesson 6, we solved asynchronous I/O and non-blocking timers by integrating epoll and timerfd into the coroutine scheduler. Now our fibers run concurrently on a single operating system thread, interleaving execution whenever they yield or wait on network events.

However, as soon as fibers share mutable data—such as an in-memory cache, an order book, or a database transaction record—they introduce race conditions.

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: Diagnose why pthread_mutex_lock and kernel futexes freeze entire cooperative fiber runtimes.
• Mastery of core invariant: Implement user-space fiber mutexes using intrusive wait-queues and voluntary stack suspension.
• Mastery of core invariant: Construct cooperative counting semaphores to throttle concurrent fiber resource access.
• 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.