Critical-Trunk-Based Obstacle-Avoiding Rectilinear Steiner Tree Routings and Buffer Insertion for Delay and Slack Optimization

• Published in: IEEE transactions on computer-aided design of integrated circuits and systems 2011-09, Vol.30 (9), p.1335-1348
• Main Authors: Lin, Yen-Hung, Chang, Shu-Hsin, Li, Yih-Lang
• Format: Article
• Language: English
• Subjects: Algorithm design and analysis; Algorithms; Buffer insertion; Buffers; Construction; Delay; Design engineering; Elmore delay model; Insertion; Internet; Joining processes; obstacle-avoiding rectilinear Steiner tree; performance-driven routing; Pins; Steiner trees; Studies; timing constraint; Topology; Trees; Wires
• ISSN: 0278-0070; 1937-4151
• DOI: 10.1109/TCAD.2011.2150222

For modern designs, delay optimization significantly facilitates success in design closure owing to its more realistic metric than wirelength in routing. Obstacle-avoiding rectilinear Steiner tree (OARST) construction is an essential routing problem. With the trends toward Internet protocol-block-based system-on-chip designs, OARST with buffer insertion has been surveyed to diminish the delay of long wires. Previous works on performance-driven (PD) OARST without and with buffer insertion can only handle small circuits. This paper develops a novel routing algorithm in obstacle-avoiding spanning graph to construct OARST with optimized delay efficiently. The proposed multisource single-target maze routing is first employed to identify the critical trunks, and the critical-trunk-based tree growth mechanism connects the unconnected pins to critical trunks under delay constraints of every sink. We apply the proposed critical-trunk-based tree growth mechanism to solve PD and slack-driven (SD) OARST problems. The proposed algorithms are extended to consider buffer insertion during PD and SD OARST constructions. Experimental results demonstrate that the proposed algorithms achieve an average 25.84% improvement in the maximum delay over obstacle-avoiding rectilinear Steiner minimal tree in the PD OARST problem and successfully solve 66.67% worst negative slack violations in the SD OARST problem. Compared to the simultaneous routing and buffer insertion approach, the proposed buffer-aware (BA) algorithm generates satisfactory timing results with almost identical wire length (WL). Moreover, the proposed BA SD OARST algorithm utilizes less WL than the BA rectilinear Steiner tree construction does by 17.99% on average. The runtime comparison with previous works shows the efficiency and scalability of this paper.