Different from global routing, detailed routing takes care of many detailed design rules and is performed on a significantly larger routing grid graph. In advanced technology nodes, it becomes the most complicated and time-consuming stage in the very large-scale integration physical design flow. We propose Dr. CU, an efficient and effective detailed router, to tackle the challenges. To handle a 3-D detailed routing grid graph of enormous size, a set of two-level sparse data structures is designed for runtime and memory efficiency. For handling the minimum-area constraint, an optimal correct-by-construction path search algorithm is proposed. Besides, an efficient bulk synchronous parallel scheme is adopted to further reduce the runtime usage. Compared with the other state-of-the-art academic detailed routers, Dr. CU reduces the number of design rule violations by one or two orders of magnitude. At the same time, it uses shorter wire length, fewer vias, and significantly less runtime. The source code of Dr. CU is available at https://github.com/cuhk-eda/dr-cu.

中文翻译：

---

CU 博士：通过稀疏网格图和最小区域捕获路径搜索进行详细路由

与全局布线不同，详细布线负责许多详细的设计规则，并在明显更大的布线网格图上执行。在先进的技术节点中，它成为超大规模集成物理设计流程中最复杂和最耗时的阶段。我们建议使用 Dr. CU，一种高效且有效的详细路由器来应对挑战。为了处理庞大的 3-D 详细路由网格图，设计了一组两级稀疏数据结构以提高运行时和内存效率。针对最小面积约束问题，提出了一种最优的构造修正路径搜索算法。此外，还采用了高效的批量同步并行方案，以进一步减少运行时的使用。与其他最先进的学术详细路由器相比，博士。CU 将违反设计规则的次数减少了一个或两个数量级。同时，它使用更短的线长、更少的过孔和显着减少的运行时间。CU 博士的源代码可在 https://github.com/cuhk-eda/dr-cu 获得。