What is an M:N scheduler and why use work-stealing?

A strong answer

A strong candidate frames What is an M:N scheduler and why use work-stealing? around the exact memory layout, compiler semantics, and hardware execution model covered in Multi-Threaded M:N Schedulers: Work-Stealing Queues and Thread-Local Workers. Explain multiplexing N user threads onto M OS threads, work-stealing for load balancing, and reduced contention.

Up to this point, our coroutine scheduler operates on a 1:N model: one operating system thread multiplexing $N$ user-space coroutines.

While a 1:N runtime executes context switches in 3 nanoseconds and multiplexes hundreds of thousands of concurrent I/O connections, it has an architectural limit: it cannot use more than one physical CPU core.

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: Differentiate 1:1, 1:N, and M:N thread scheduling models and analyze scalability trade-offs.
• Mastery of core invariant: Implement a lock-free single-producer, multi-consumer Chase-Lev work-stealing deque using C11 atomics.
• Mastery of core invariant: Eliminate global queue lock contention through thread-local worker queues and randomized stealing.
• 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.