This paper presents a high-quality very large scale integration （VLSI） global router in X-architecture, called XGRouter, that heavily relies on integer linear pro- gramming （ILP） techniques, partition strategy and...This paper presents a high-quality very large scale integration （VLSI） global router in X-architecture, called XGRouter, that heavily relies on integer linear pro- gramming （ILP） techniques, partition strategy and particle swarm optimization （PSO）. A new ILP formulation, which can achieve more uniform routing solution than other formu- lations and can be effectively solved by the proposed PSO is proposed. To effectively use the new ILP formulation, a partition strategy that decomposes a large-sized problem into some small-sized sub-problems is adopted and the routing re- gion is extended progressively from the most congested re- git）n. In the post-processing stage of XGRouter, maze rout- ing based on new routing edge cost is designed to further optimize the total wire length and mantain the congestion uniformity. To our best knowledge, XGRouter is the first work to use a concurrent algorithm to solve the global rout- ing problem in X-architecture. Experimental results show that XGRouter can produce solutions of higher quality than other global routers. And, like several state-of-the-art global touters, XGRouter has no overflow.展开更多
文摘This paper presents a high-quality very large scale integration （VLSI） global router in X-architecture, called XGRouter, that heavily relies on integer linear pro- gramming （ILP） techniques, partition strategy and particle swarm optimization （PSO）. A new ILP formulation, which can achieve more uniform routing solution than other formu- lations and can be effectively solved by the proposed PSO is proposed. To effectively use the new ILP formulation, a partition strategy that decomposes a large-sized problem into some small-sized sub-problems is adopted and the routing re- gion is extended progressively from the most congested re- git）n. In the post-processing stage of XGRouter, maze rout- ing based on new routing edge cost is designed to further optimize the total wire length and mantain the congestion uniformity. To our best knowledge, XGRouter is the first work to use a concurrent algorithm to solve the global rout- ing problem in X-architecture. Experimental results show that XGRouter can produce solutions of higher quality than other global routers. And, like several state-of-the-art global touters, XGRouter has no overflow.
