GRIP scalable 3D global routing using integer programming

• Published in: 2009 46th ACM/IEEE Design Automation Conference pp. 320 - 325
• Main Authors: Wu, Tai-Hsuan, Davoodi, Azadeh, Linderoth, Jeffrey T.
• Format: Conference Proceeding
• Language: English
• Published: New York, NY, USA ACM 26.07.2009; IEEE
• Series: ACM Conferences
• Subjects: Algorithm design and analysis; Computer industry; Costs; Global Routing; Hardware > Electronic design automation > Physical design (EDA); Integer Programming; Linear programming; Mesh generation; Pricing; Routing; Runtime; Scalability; Systems engineering and theory; integer programming; global routing
• ISBN: 9781605584973; 1605584975
• ISSN: 0738-100X
• DOI: 10.1145/1629911.1629999

We propose GRIP, a scalable global routing technique via Integer Programming (IP). GRIP optimizes wirelength and via cost without going through a layer assignment phase. GRIP selects the route for each net from a set of candidate routes that are generated based on an estimate of congestion generated by a linear programming pricing phase. To achieve scalability, the original IP is decomposed into smaller ones corresponding to balanced rectangular subregions on the chip. We introduce the concept of a floating terminal for a net, which allows flexibility to route long nets going through multiple subregions. We also use the IP to plan the routing of long nets, detouring them from congested subregions. For ISPD 2007 benchmarks, we obtain 3.9% and 11.3% average improvement in wirelength and via cost for the 2D and 3D versions respectively, compared to the best results reported in the open literature.