Open-Weights Model Serving Interview Questions

Derive a deployment candidate from the official tensor index, then account for latent-cache replication and the product workload. A worked example shows why enough aggregate HBM can still leave every GPU out of memory.

Find which startup step runs out of memory, count the allocations on that GPU, and change the setting that controls the shortage.

Turn public metadata into a deployment candidate with explicit uncertainty. Inspect architecture, stored formats and engine support, then work a per-rank memory example that explains why an aggregate fit can fail.

Find whether expert placement, small batches or communication makes the deployment slower. Compare equivalent workloads and inspect the worker that holds up each step.

Measure reachable prefix reuse, separate token savings from latency, and compare both engines on the same agent contract and resource budget.

Use the actual tensor index to size Kimi K3, then separate a published hardware starting point from production capacity. Account for mixed precision, hybrid recurrent state, parser behavior, and the workload behind a throughput claim.

Check the bound’s assumptions, locate the critical path, and quantify which optimization can actually improve one user’s decode latency.

Derive a prompt-plus-output contract, calculate per-rank state capacity, and measure the concurrency that meets latency and overload targets.

The answers sound fluent, but the scores dropped. Compare inputs, generation settings, raw output, parsing and scoring to find where the new deployment differs.

Define a reproducible workload and service contract, account for every offered request, and choose a measured operating region with evidence and margin.

Compare actual encoded tensors, per-rank runtime fit, supported kernels and held-out task quality. Four-bit weight-only kernels can accelerate wider arithmetic, and smaller weights need not reduce the GPU count.

A repeated-prompt test measures one reuse pattern. Production gains depend on token-weighted reuse, routing, residency, alignment and the prefill share of latency; a falling hit rate does not uniquely identify eviction.

Long prefills coincide with decode stalls. Compare a tuned combined pool with separate phases, derive transfer and pool capacity, and test whether the improvement survives connector failures.

The nodes joined the cluster, but the first request hangs. Trace how far it got, check worker assignments, and reproduce the blocked operation on the same communication path.

The output forecast is a starting point. Match the prompt and state workload, derive replica counts from an SLO-tested rate, check simultaneous loss scenarios and keep the cost denominator consistent with the forecast.

Compare committed output per complete draft-and-verify cycle with ordinary decoding. Derive the acceptance-length model, separate it from engine counters, and test latency, goodput and memory across the actual workload.

Confirm that requests are waiting for usable state capacity. Separate allocated memory, live blocks and evictable prefixes, then compare admission, lower-precision state, prefix sharing and hardware changes with explicit assumptions.

A fourfold ratio is a symptom, not a diagnosis. Trace individual requests, separate waiting from execution and delivery, and test workload, scheduling, cache and capacity hypotheses against the service objective.

Build a week around release gates and dependencies. Budget artifact transfer, validate the exact runtime path, measure the intended workload, and size the canary evidence before promising full rollout.

Price the same workload and service guarantees, including input tokens, idle capacity, failures and operations. Then check whether the algebraic crossover fits the fleet before treating it as a buying decision.

An apparent outlier can reflect workload mix, queueing, runtime state or a degraded execution path. Normalize the comparison, run a matched replay and use critical-path arithmetic to test possible causes.

A context-window limit is not a latency or concurrency guarantee. Budget retained state, prefill and shared service time; distinguish cache reuse from eliminating work; choose isolation only when measured interference justifies its cost.

A minor revision can change weights, encoding or response behavior. Compare pinned deployment bundles, evaluate task slices, monitor a representative canary and keep enough capacity to restore the old service.

Design a shared catalogue with explicit service tiers, reproducible deployments and bounded cold starts. Residency depends on burst behavior and resource reuse; placement depends on GPU groups and interference as well as memory.

Apply the project’s offline tuning guidance in context, derive the memory tradeoff, and use workload-specific acceptance criteria instead of universal queue and headroom targets.

Verify the throughput definition and service outcomes, compare resolved configurations and execution traces, then isolate supported changes. Quantify capacity replacement correctly and choose rollback from the full release risk.

Budget growing attention state, bounded recurrent state and retained prefix snapshots separately. Work the short-context crossover, then test whether the cache manager resumes every layer from the same prefix boundary.

Separate pre-routing from a sequential cascade, charge every attempted generation, and measure checker mistakes. A lower escalation rate is not proof of higher quality, and the largest model is not a correctness oracle.

Define whether half the footprint means checkpoint bytes or runtime memory. Choose a supported recipe, measure which tensors it changes, separate calibration from held-out evaluation, and validate quality and serving cost.

Define cold and reused-context objectives, verify the checkpoint's real state layout, and size per-rank memory and transfer demand. Caching and phase separation help only when their compatibility, retention and capacity assumptions hold.

Follow media through fetching, preprocessing, encoding and language-model execution. Derive visual positions from the actual processor output, account for encoder placement and separate the caches and latency stages that text-only monitoring misses.

A partial drop does not rule out the parser. Define success and its denominator, trace failures through encoding, generation, parsing and execution, then replay the relevant boundary with controlled versions.

Test the complete serving bundle with contract fixtures, representative tasks and load-aware outcomes. Preserve paired results, calibrate the scorer and distinguish a relative improvement from meeting an absolute product requirement.

Constrained decoding restricts valid continuations; it does not guarantee completion or correct values. Define success and error contracts, validate supported schemas, and measure compilation, masking and queueing under the actual workload.

Attribute queueing, token work and live state before choosing a cap. Bound new admission, verify recovery, and distinguish fair scheduling, reserved service and physical isolation without promising instant or absolute protection.

Screen exact checkpoints for hard requirements, then compare deployable candidates on held-out product tasks, service limits and total cost. Smaller artifacts, leaderboard scores and token rates each answer only part of the decision.

Measure exposed launch and dispatch delay, actual graph coverage, capture memory and warmup. Batch size influences the result, but does not alone determine whether graphs improve the service.

Group compatible adapters by pinned base, derive their size from target matrices and ranks, and benchmark mixed batches. Catalogue size, CPU residency, GPU slots and active adapters are separate limits; base sharing does not make fifty variants operationally free.

A mutable branch or local model directory can change what a restarted replica loads. Establish the actual artifact identity, separate disk evidence from loaded state, and make rollout and restart behavior reproducible.

Validate the exact model, accelerator generation and serving features. Separate packed storage from kernel execution, derive the real memory fallback, and compare qualified throughput and total migration cost.

Follow a shard index to the tensors a loader actually receives. Diagnose a missing file and a shape mismatch, then check architecture, quantization and request compatibility before changing hardware.

Separate tensor format, model semantics and runtime support. Budget weights plus context state, and check conversion before judging a quantized artifact.

Trace graph rewrites, provider placement and shape profiles. Use a fallback counterexample to show why fewer operators can still produce higher latency.

Map a checkpoint format to compute capability, then say which part of the speedup survives on each generation. The same file can load on two GPUs and take two different execution paths.

Turn a benchmark number into a bill that survives real utilization, then write the serving contract the gateway enforces and the evaluation the tuned configuration still owes.

A measured run shows where the time goes in a small batch job, then why every result parsed but none was deliverable. The answer turns on startup cost, co-tenant latency and a per-item contract.

Walk a single-GPU vLLM Deployment from pod scheduling to the first token, then show the three settings that turn a working manifest into restart loops and stuck rollouts.

Same model, same engine name, different execution model. Trace what moves into compilation, how shape buckets trade compile time for padding, and how per-device memory decides the slice.