Job queues are deceptively tricky
Summary
The article examines the complexities of job queues, focusing on scheduling, concurrency, and fault models. It compares semantics like Parallel Spawn, Wait, Prefer New, and Prefer Old, and argues that choosing the right semantics and documenting limits can help design more predictable and scalable systems.