In this research, our main goal was to develop a routing technique for nets whose degree is greater than 8. We chose the threshold of 8 because our routing solution database contains pre-computed routing solutions only up to net degree 8. The size of this database grows with the number of pins considered, and since we are running the source code on local machines rather than on powerful servers, we must limit the database size to ensure manageable runtime and memory use. Therefore, we utilize this solution set—referred to as the RSMT database—to reduce the overall execution time.

Our main approach to solving the high-degree net routing problem is to break down nets whose degree exceeds 8. We have applied advanced net-breaking techniques to achieve this. Another method we use is the bin (or cluster) technique, where the entire design is divided into several rectangular regions called bins. Routing within bins naturally reduces net degree because each bin contains fewer pins. After partitioning, we perform routing inside each bin.

This approach allows us to handle high-degree nets efficiently without increasing the size of the routing solution database.

Note:  Please go-through chapter-3 from thesis book to get clear idea about our working methodology.