mediumNVIDIACerebras

Write a thread-safe counter in C++ that many threads increment. What are the memory-ordering and layout choices?

Implement shared and sharded C++ counters, explain relaxed ordering and test final counts without promising unmeasured scaling.

Updated Sep 2026 · Learn how AI infrastructure works through explanations, worked examples and diagrams, then practise applying it to interview questions.

Implement shared and sharded C++ counters, explain relaxed ordering and test final counts without promising unmeasured scaling.

The full answer is part of Premium. A free account includes more answers in each topic, but does not unlock this one.

20 answers per topic instead of 10, plus saved progress and bookmarks · no cardor unlock all 316 remaining answers · ₹2,000 / $25

The concepts behind this question

Use these concept explanations to review the ideas behind this question.

Foundational

💻 Coding for Infra

Cache-Friendly Data StructuresData layout affects cache misses and communication between CPU cores. Pointer chasing and false sharing explain why equivalent operations can have different memory costs.

Advanced

💻 Coding for Infra🔒 Premium

Concurrency in Python, Go and C++Concurrency primitives coordinate overlapping work and shared state. Choose threads, processes or asynchronous tasks from the runtime and the work they must perform.

Advanced

💻 Coding for Infra🔒 Premium

Asynchronous GPU Buffer OwnershipA host function can return while a GPU still uses its pointers. Tie buffer reuse to device completion, including cancellation, cross-stream consumers and foreign-function boundaries.

Foundational

🧮 Napkin Math & Capacity

KV Cache SizingDerive cache payload from the stored attention state, then account for mixed sequence lengths, block allocation and per-device limits. Worked examples distinguish exact bytes from deployable capacity.

Explore the full curriculum →

UP NEXT ON YOUR JOURNEY

Next in this trackWhy is std::unordered_map rarely the fastest hash map, and what would you use instead?Next in this trackImplement a work-stealing deque. Why do the owner and the thieves take from opposite ends?Next in this trackSimulate speculative decoding to find the expected tokens per round and the batch size where it stops paying.

FEDITOR'S NOTE

Look for a correct read and publication contract, explicit writer assignment, safe aggregation and target-specific layout reasoning.

DISCUSSION · 0

No comments yet — be the first to share your approach.