Buffer Insertion Based on Single-pair Shortest-path Algorithm for Interconnect-Centric Floorplanning
2006Vol. 24, pp. 1873–1875
Citations Over Time
Abstract
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
Related Papers
- → Towards shortest path computation using Dijkstra algorithm(2017)65 cited
- → Comparison of Variants of Yen's Algorithm for Finding K-Simple Shortest Paths(2022)9 cited
- → Comparison Studies for Different Shortest path Algorithms(2015)20 cited
- An Improved Bellman Algorithm for the Kth-shortest Path Problem(2006)
- To Figure Out the First Rth Shortest Path Based on Optimal Floyed Algorithm(2009)