Timing driven routing tree construction

As technology scales down quickly, timing becomes more and more critical in modern designs. During placement and routing, a lot of techniques are applied to reduce circuit delay. A good timing driven routing tree construction can influence placement and routing significantly. As circuits become more and more complex, previous algorithms may not be efficient enough to be applied in modern designs. In this paper, we propose a new algorithm to construct timing-driven routing trees to trade off wirelength and timing. Our tree construction is based on properties of shortest path tree and minimum spanning tree. Experimental results show that our algorithm can obtain a smaller delay while keeping the wirelength short.