Reclaiming over-the-IP-block routing resources with buffering-aware rectilinear Steiner minimum tree construction
ICCAD(2012)
摘要
In this paper, we study an often overlooked but very important and practical problem of building Buffering-aware Over-the-Block rectilinear Steiner minimum tree (BOB-RSMT). In most previous works, the routing resources over the IP blocks were simply treated as routing blockages, resulting in significant waste of routing resources on higher metal layers not utilized by internal intra-block routing. On the other hand, routing over large IP blocks needs special attention as there is no way to insert buffers inside hard IP blocks, which can lead to unresolvable slew/timing violations. In this paper, we propose a novel BOB-RSMT algorithm which helps reclaim the “wasted” over-the-block routing resources while meeting user-specified slew constraints. Our algorithm incrementally and efficiently migrates initial tree structures with buffering-awareness to meet slew constraints while minimizing wire length. It can handle complex blocks including rectilinear shapes. Our experiments on various benchmarks demonstrate very promising results. By utilizing over-the-block routing resources intelligently, we can save the outside-block wire length as well as the total wire length significantly compared with the conventional obstacle-avoiding rectilinear Steiner minimum tree (OA-RSMT) algorithms. BOB-RSMT also reduces the repeater count/area needed to satisfy slew constraints, which is very important for modern design closure.
更多查看译文
关键词
slew constraint,hard ip block,ip networks,migrates initial tree structure,bob-rsmt,routing resource,wasted over-the-block routing resources,trees (mathematics),unresolvable slew-timing violations,ip block,slew constraints,user-specified slew constraint,buffering-aware over-the-block rectilinear steiner minimum tree construction,large ip block,metal layers,over-the-ip-block routing resource,rectilinear shapes,user-specified slew constraints,buffering-awareness,obstacle-avoiding rectilinear steiner minimum tree algorithms,over-the-ip-block routing resources,telecommunication network routing,internal intra-block routing,rectilinear steiner minimum tree,oa-rsmt algorithms,over-the-block routing resource,optimization,scalability,capacitance,merging,debug,routing
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络