Overview
What this challenge is about.
Implement an MPSC (multi-producer single-consumer) ring-buffer queue in Go using atomic operations only — no mutexes. Prove correctness with the Go race detector across 8 producer goroutines and 1 consumer for 5 minutes of randomized load. Benchmark p50/p99 enqueue latency and end-to-end throughput vs the current mutex-based slice. Run on the provided event-shaped load generator (around 220k events/second peak). Deliver source, race-detector logs proving correctness, a benchmark report, and a 5-page design doc explaining the memory-ordering choices.
The Brief
What you'll do, and what you'll demonstrate.
Ship a lock-free MPSC ring-buffer queue in Go that beats a mutex-protected slice on throughput and p99 latency, with race-detector evidence of correctness.
Earning criteria — what you'll demonstrate
- Implement an MPSC ring-buffer queue using atomic operations only
- Reason about memory ordering and the Go memory model
- Use the race detector to prove (not just check) correctness
- Benchmark concurrent code honestly, accounting for cache effects
Program Fit
Where this fits in your program.
Sharpens the same skills your degree expects you to demonstrate.
Skills
Skills you'll demonstrate.
Each one shows up on your verified credential.
Careers
Roles this prepares you for.
Real titles. Real skill bridges. Pick the one closest to your trajectory.
Career mappings coming soon.