{ "schema_version": 1, "builder_plan": { "scenario": "Long customer conversations exhaust memory or limit concurrent requests.", "change": "Change only the attention cache policy, after checking model and runtime support.", "baseline": "The same model with its ordinary attention cache.", "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": "Peak cache memory, long-context answer quality, first-token latency, and requests completed.", "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.19207", "title": "MeshKV: A Network-on-Chip KV Cache Fabric for Scalable Transformer Decoding Accelerators", "summary": "It replaces compression and DRAM-placement KV systems that concentrate traffic on centralized memory paths with a packetized KV fabric over a lightweight NoC, using affine striping, multicast with duplicate suppression, and prefetch/softmax overlap behind credit-aligned FIFOs. The cost is a custom tiled FPGA/accelerator design with NoC routing, credit-aligned buffering, and verified duplicate suppression, which is substantial hardware complexity and not portable to a commodity 24 GB GPU or third-party API. It can fail to transfer because the reported gains are specific to an 8x8 FPGA prototype under multi-stream long-context load, depend on NoC topology and flow control correctness, and do not address the DRAM/HBM and kernel bottlenecks that dominate single-GPU serving.", "rationale": "The technique is demonstrated only on a custom 8x8 FPGA NoC prototype, so its throughput claims are credible but not actionable for a reader limited to one 24 GB GPU or managed APIs.", "technique": "NoC packetized KV cache fabric for tiled accelerators", "family": "cache_kv", "recommendation": "observar", "published": "2026-09-16", "as_of": "2026-10-18", "editorial_status": "indexed", "source_url": "https://arxiv.org/abs/2609.19207", "independent_implementations": 0, "total_implementations": 0, "stars": 0, "citations": 0, "claims": [ { "claim_id": "claim-01", "statement": "It replaces compression and DRAM-placement KV systems that concentrate traffic on centralized memory paths with a packetized KV fabric over a lightweight NoC, using affine striping, multicast with duplicate suppression, and prefetch/softmax overlap behind credit-aligned FIFOs. The cost is a custom tiled FPGA/accelerator design with NoC routing, credit-aligned buffering, and verified duplicate suppression, which is substantial hardware complexity and not portable to a commodity 24 GB GPU or third-party API. It can fail to transfer because the reported gains are specific to an 8x8 FPGA prototype under multi-stream long-context load, depend on NoC topology and flow control correctness, and do not address the DRAM/HBM and kernel bottlenecks that dominate single-GPU serving.", "basis": "inferred", "result": "", "baseline": "", "conditions": "", "source_url": "https://arxiv.org/abs/2609.19207", "source_page": null, "source_excerpt": "" }, { "claim_id": "claim-02", "statement": "On an 8x8 FPGA with LLaMA-2-7B and Mistral-7B at 8K-32K context, MeshKV reports up to 1.9x multi-stream throughput, 2.1x KV bandwidth utilization, and up to 58% lower interconnect traffic.", "basis": "inferred", "result": "", "baseline": "", "conditions": "", "source_url": "https://arxiv.org/abs/2609.19207", "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": "" }