arXiv (All)
open access
Whole-Route Planning of a Memory Bus Between Two BGAs: An Exact Model of Crossings and Layer Changes, Negotiated to DRC-Clean Copper
Routing the bus between a processor and its DRAM remains largely manual in printed circuit board (PCB) design, and published algorithms optimize proxies such as crossing or layer counts. We present a router that plans every lane of a two-layer BGA-to-BGA bus before any copper is laid, and carries th
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- GATE: GPU-Accelerated Traffic Engineering for the WAN#155215
- DreamRAM: A Fine-Grained Configurable Design Space Modeling and Exploration Tool for Custom 3D Die-Stacked Dynamic Random-Access Memory#308134
- Reconfigurable bus-based quantum router for modular superconducting processors#1076537
- Torch-PIM: Automated Profile-Guided PIM Offloading for PyTorch#1128917
- Torch-PIM: Automated Profile-Guided PIM Offloading for PyTorch#1108708
Record · ID 1459071
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive