MAX LENGTH DRIVEN GLOBAL ROUTING

Abstract

In order to maintain signal integrity and reasonable delay in high frequent designs, each critical net must undergo buffer insertion. At the same time a big number of nets in such designs create restrictions in terms of algorithms' run time. This paper studies the problem of constructing minimum cost buffered routing trees in high utilized and congested designs with possible buffer locations.