mediumMetaAnthropic

Given per-rank heartbeats from a training job, detect which rank has stopped and when. What produces false positives?

Detect missing and silent ranks from a roster, distinguish liveness from progress, and derive thresholds without assuming independent delays.

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

Detect missing and silent ranks from a roster, distinguish liveness from progress, and derive thresholds without assuming independent delays.

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.

Advanced

💻 Coding for Infra🔒 Premium

Batching Queues and BackpressureA request batcher groups work to reduce processing overhead. Queue bounds, dispatch timing and failure handling keep that efficiency from becoming uncontrolled waiting.

Advanced

💻 Coding for Infra🔒 Premium

Interval Merging and Utilization LogsInterval merging finds periods of activity and gaps between them. A sweep over start and end events also measures concurrency and utilization.

Foundational

💻 Coding for Infra

The GPU Credit Scheduler PatternA credit scheduler admits jobs without overspending an account’s balance. Clear state transitions make priority, cancellation and refunds easier to implement correctly.

Core

💻 Coding for InfraSign in

Retry, Backoff and IdempotencyRetries can recover transient failures, but they also add load and may repeat side effects. Backoff, retry budgets and idempotency make that behavior explicit.

Explore the full curriculum →

UP NEXT ON YOUR JOURNEY

Next in this trackWrite a thread-safe counter in C++ that many threads increment. What are the memory-ordering and layout choices?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?

FEDITOR'S NOTE

Look for an explicit clock domain, boundary and startup behavior, sound probability reasoning and evidence-based diagnosis.

DISCUSSION · 0

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