ACM Home Page
Please provide us with feedback. Feedback
An integer linear programming based routing algorithm for flip-chip design
Full text PdfPdf (481 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 44th annual Design Automation Conference table of contents
San Diego, California
SESSION: 3D IC and package design issues table of contents
Pages: 606 - 611  
Year of Publication: 2007
ISBN ~ ISSN:0738-100X , 978-1-59593-627-1
Authors
Jia-Wei Fang  National Taiwan University, Taipei, Taiwan
Chin-Hsiung Hsu  National Taiwan University, Taipei, Taiwan
Yao-Wen Chang  National Taiwan University, Taipei, Taiwan
Sponsors
: The EDA Consortium
: IEEE/CASS/CANDE/CEDA
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 61,   Citation Count: 10
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1278480.1278633
What is a DOI?

ABSTRACT

The flip-chip package provides a high chip-density solution to the demand for more I/O pads of VLSI designs. In this paper, we present the first routing algorithm in the literature for the pre-assignment flip-chip routing problem with a pre-defined netlist among pads and wire-width and signal-skew considerations. Our algorithm is based on integer linear programming (ILP) and guarantees to find an optimal solution for the addressed problem. It adopts a two-stage technique of global routing followed by detailed routing. In global routing, it first uses two reduction techniques to prune redundant solutions and create a global-routing path for each net. Without loss of the solution optimality, our reduction techniques can further prune the ILP variables (constraints) by 85.5% (98.0%) on average over a recent reduction technique. The detailed routing applies X-based grid-less routing to complete the routing. Experimental results based on five real industry designs show that our router can achieve 100% routability and the optimal global-routing wirelength and satisfy all signal-skew constraints, under reasonable CPU times, while recent related work results in much inferior solution quality.



CITED BY  10

Collaborative Colleagues:
Jia-Wei Fang: colleagues
Chin-Hsiung Hsu: colleagues
Yao-Wen Chang: colleagues