Buffer Insertion Based on Single-pair Shortest-path Algorithm for Interconnect-Centric Floorplanning

This paper studies the buffer insertion algorithm for interconnect centric floorplanning. We develop a buffer insertion algorithm based on single-pair shortest-path algorithm. With the assumption that buffers could be inserted anywhere in dead space, the authors construct a graph which takes geometry grid cells on borders of dead spaces as the vertex and reduce the buffer insertion problem into a shortest-path problem. With this algorithm applied, the number of nets which meet its timing constraint is improved