NCTU-GR 2.0: Multithreaded Collision-Aware Global Routing With Bounded-Length Maze Routing
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems(2013)
摘要
Modern global routers employ various routing methods to improve routing speed and quality. Maze routing is the most time-consuming process for existing global routing algorithms. This paper presents two bounded-length maze routing (BLMR) algorithms (optimal-BLMR and heuristic-BLMR) that perform much faster routing than traditional maze routing algorithms. In addition, a rectilinear Steiner minimum tree aware routing scheme is proposed to guide heuristic-BLMR and monotonic routing to build a routing tree with shorter wirelength. This paper also proposes a parallel multithreaded collision-aware global router based on a previous sequential global router (SGR). Unlike the partitioning-based strategy, the proposed parallel router uses a task-based concurrency strategy. Finally, a 3-D wirelength optimization technique is proposed to further refine the 3-D routing results. Experimental results reveal that the proposed SGR uses less wirelength and runs faster than most of other state-of-the-art global routers with a different set of parameters , , , . Compared to the proposed SGR, the proposed parallel router yields almost the same routing quality with average 2.71 and 3.12-fold speedup on overflow-free and hard-to-route cases, respectively, when running on a 4-core system.
更多查看译文
关键词
task based concurrency strategy,time consuming process,routing quality,rip-up and reroute,sequential global router,network routing,global routing algorithm,routing tree,tree searching,monotonic routing,various routing method,heuristic blmr,multi-threading,4 core system,physical design,multithreaded collision aware global routing,parallel router,global routers,maze routing,3d routing,rectilinear steiner minimum tree aware routing,routing speed,multithreaded routing,parallel multithreaded collision aware global router,global routing,3d wirelength optimization technique,partitioning based strategy,bounded length maze routing algorithm
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络