High performance routing trees with identified critical sinks

Abstract

We present two critical-sink routing tree (CSRT) constructions which exploit critical-path information that becomes available during timing-driven layout. Our CS-Steiner heuristics with ″Global Slack Removal″ modify traditional Stenier constructions and produce routing trees with significantly lower critical sink delays compared with existing performance-driven methods. We also propose a new class of Elmore routing tree(ERT) constructions, which iteratively add tree edges to minimize Elmore delay. This direct optimization of Elmore delay yields trees that improve delays to identified critical sinks by up to 69% over minimum Steiner routings. ERTs also improve performance over such recent methods as [1] [6] when no critical sinks are specified.