{ "schema_version": 1, "builder_plan": { "scenario": "Your inference service slows down when several customers send requests together.", "change": "Replay a recorded request trace with only the proposed serving policy changed.", "baseline": "Your current scheduler on the same model and hardware.", "steps": [ "Locate the paper's implementation and check its license, model support, data needs, and hardware requirements. Stop here if you cannot obtain the required artifacts.", "Save a small set of representative product tasks and expected outcomes. Keep evaluation tasks out of any training or tuning, and choose quality and cost limits before running.", "Run the baseline and the proposed change on identical inputs. Keep other settings fixed and repeat paired runs to expose variation.", "Save per-task outputs, failures, timings, and all usage costs. Review regressions before expanding the test." ], "measure": "Requests meeting your latency target, throughput, failures, and cost per successful request.", "decision": "Keep the change only if it meets your preselected quality and latency limits and improves the metric you care about after setup and operating costs. Otherwise retain the baseline. This is an exploration plan, not a validated recommendation." }, "builder_review": null, "arxiv_id": "2609.37828", "title": "Joint Effects of GPU Server Topology, Parallelism, and Congestion Control on MoE Inference: A Controlled Simulation Study", "summary": "This replaces ad-hoc selection of TP/EP partitioning, collective algorithms, and congestion control for multi-node MoE inference with a controlled simulation methodology showing these choices must be co-optimized against server topology and rank mapping. It costs nothing to read but its conclusions are only actionable on multi-node GPU clusters with configurable interconnects and congestion control, none of which a single 24 GB GPU or API-based setup provides. Its findings can fail to transfer because they are simulator-derived (ASTRA-sim/NS-3) on synthetic prefill-only traces with fixed 4096-token lengths, so real decode-heavy workloads and actual hardware may behave differently.", "rationale": "The study requires a 32-GPU multi-node environment with configurable interconnects that the reader does not have, though its guidance (prefer expert-parallel-heavy partitioning, Ring collectives, HPCC over DCQCN) is worth retaining if they ever move to multi-node MoE serving.", "technique": "Joint topology-parallelism-congestion tuning for MoE inference", "family": "serving_e_batching", "recommendation": "observar", "published": "2026-09-29", "as_of": "2026-10-18", "editorial_status": "indexed", "source_url": "https://arxiv.org/abs/2609.37828", "independent_implementations": 0, "total_implementations": 0, "stars": 0, "citations": null, "claims": [ { "claim_id": "claim-01", "statement": "This replaces ad-hoc selection of TP/EP partitioning, collective algorithms, and congestion control for multi-node MoE inference with a controlled simulation methodology showing these choices must be co-optimized against server topology and rank mapping. It costs nothing to read but its conclusions are only actionable on multi-node GPU clusters with configurable interconnects and congestion control, none of which a single 24 GB GPU or API-based setup provides. Its findings can fail to transfer because they are simulator-derived (ASTRA-sim/NS-3) on synthetic prefill-only traces with fixed 4096-token lengths, so real decode-heavy workloads and actual hardware may behave differently.", "basis": "inferred", "result": "", "baseline": "", "conditions": "", "source_url": "https://arxiv.org/abs/2609.37828", "source_page": null, "source_excerpt": "" }, { "claim_id": "claim-02", "statement": "TP16EP2 requires 3.68-4.35x the mean completion time of TP2EP16; Ring collectives beat Double Binary Tree by 28.3-83.2%; RoCE DCQCN is 23.8-35.7% slower than RoCE HPCC.", "basis": "inferred", "result": "", "baseline": "", "conditions": "", "source_url": "https://arxiv.org/abs/2609.37828", "source_page": null, "source_excerpt": "" } ], "exposure_map": [ { "dimension": "quality", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" }, { "dimension": "compute", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" }, { "dimension": "latency", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" }, { "dimension": "operations", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" }, { "dimension": "compatibility", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" }, { "dimension": "security", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" }, { "dimension": "data_and_training", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" }, { "dimension": "reproducibility", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" } ], "risks": [], "minimum_test": [], "open_questions": [], "independent_tests": [], "lab_reproductions": [], "report_available": false, "validation_tier": "unknown", "evidence_tier": "unknown", "infrastructure_basis": "unknown", "equations": [], "equations_status": "not_fetched", "core_kind": "", "equations_fetched_at": "", "equations_source_url": "", "equations_source_sha256": "", "exposures_reviewed_at": "", "exposures_source_sha256": "" }