⌘K
ENES
GitHub
phase~1 min de lecturaActualizado 2026-06-30#phase#concurrency
Esta nota todavía no está traducida, así que se muestra la fuente en inglés.

Phase 04 · Concurrency at Scale

The central problem of this atlas: connections that stay open for the life of a session and need to see each other. epoll/kqueue event loops vs thread-per-connection vs hybrid thread pools, the C10K problem and its evolution to C10M, broadcasting from one connection to N without blocking the loop, and lock vs lock-free data structures for the registry of active connections.

Notas relacionadas

Low-LevelPhase 00 · OrientationWhere to start, what Atlas I and II you need first, and how this atlas is organized.Low-LevelPhase 01 · TCP from ScratchRaw BSD sockets to the bone — the handshake, Nagle, buffers, backpressure, and real network errors.Low-LevelPhase 02 · Design Your Own ProtocolFraming, binary serialization, versioning, and heartbeats over raw TCP — before adopting WebSocket.Low-LevelPhase 03 · WebSocket, for RealRFC 6455 implemented by hand in C — handshake, frame format, control frames, fragmentation, close.