Performance-driven Steiner tree algorithm for global routing

Publisher Website
Google Scholar
Abstract
This paper presents two performance-driven Steiner tree algorithms or global routing which consider the / minimization o timmg delay durin the tree construc“$ tion as th~ goal. One algomthm M ased on nonlinear optimization method, another uses heuristic approach to guide the construction o Steiner tree. A new timin [ model is established whit includes both total len t / f and critical path between source and sink in delay ormulation, and an upper bound for timing delay is deducted and used to guide both algorithms. Experiment results are given to demonstrate the effectiveness of the two algorithms.

This publication has 0 references indexed in Scilit: