Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Figures
TABLE I CHARACTERISTICS OF THREE CHIP-PACKAGE CO-DESIGNS. 
Fig. 1. The pin assignment and routing problem of a simple chip-package co-design. External pins of two ICs (a) with superimposed signal pins of the chip carrier (b), the optimized pin assignment illustrated by flylines (c), and the final pin routing (inset). 
Fig. 11. Integration of pin assignment optimization into the layout synthesis process. Related input and output data are indicated on the right. 
Fig. 2. Classification of routability prediction methods sorted by their granularity from coarse (top) to detailed (bottom). 
TABLE II ANALYSIS OF THE ROUTABILITY OF PIN ASSIGNMENTS OPTIMIZED ON THE BASIS OF BASIC GEOMETRIC CHARACTERISTICS OR OUR CONGESTION PREDICTION METHOD (ROUTING RESULTS ACHIEVED WITH CADENCE SPECCTRA AUTO ROUTER). 
Fig. 12. Comparison of probabilistic congestion prediction methods. Six probabilistic prediction methods and our prediction method “WF” using four values for parameter η90 = {1.00,1.15,1.30,1.45} are compared with global routing results. Our interface optimization uses the most accurate congestion prediction method “WF 1.45” (“predicted local congestion” in Tab. II).
Citations
Planning Massive Interconnects in 3-D Chips
TL;DR: A novel 3-D-floorplanning methodology is proposed which accounts for different types of interconnects in a unified manner, and one key idea is to align cores/blocks simultaneously within and across dies, thus increasing the likelihood of successfully implementing complex and massive interConnects.
35
Multi-Objective 3D Floorplanning with Integrated Voltage Assignment
TL;DR: This article introduces, implements, and evaluates novel algorithms for effective integration of voltage assignment into the inner floorplanning loops, and achieves results that surpass naïve low-power and high-performance voltage assignment by 17% and 10%, on average.
11
Routability-driven bump assignment for chip-package co-design
Meng-Ling Chen,Tu-Hsiung Tsai,Hung-Ming Chen,Shi-Hao Chen +3 more
- 20 Feb 2014
TL;DR: Experimental results show that the proposed method (inspired by board escape routing algorithms) automatically finishes bump assignment, RDL routing and substrate routing in a short time, while the traditional co-design flow requires weeks even months.
1
Verdrahtungsvorhersage im dreidimensionalen Layoutentwurf
Tilo Meister
- 01 Jan 2012
TL;DR: The Layoutentwurf elektronischer Schaltungen erfolgt in einer Kette einzelner Entwurfsaufgabe (Abb. 10.1) as mentioned in this paper.
References
Probabilistic congestion prediction
Jurjen Westra,Chris Bartels,Patrick Groeneveld +2 more
- 18 Apr 2004
TL;DR: This paper shows experimentally that the number of two-pin nets with more than two bends in the actual router is negligible, and it is established that the ratio between the numbers of L-shapes and Z-sh shapes is more or less a constant.
145
A method of measuring nets routability for MCM's general area routing problems
Kusnadi,J.D. Carothers +1 more
- 12 Apr 1999
TL;DR: A method for measuring routability/wireability is proposed for use in general area routing problems of MCM designs by extending the counting method of Pascal's Triangle for potential routes of each net.
A correct network flow model for escape routing
Tan Yan,Martin D. F. Wong +1 more
- 26 Jul 2009
TL;DR: A new network flow model is proposed that guarantees the correctness when diagonal capacity is taken into consideration and leads to the first optimal algorithm for escape routing.
70
Accurate pseudo-constructive wirelength and congestion estimation
Andrew B. Kahng,Xu Xu +1 more
- 05 Apr 2003
TL;DR: A practical stochastic routing probability distribution model which includes the effects of blockage and the number of bends is proposed which can improve the total wirelength estimation accuracy by 90% on average with respect to the traditional RSMT wirelength estimate.
An Integer-Linear-Programming-Based Routing Algorithm for Flip-Chip Designs
TL;DR: Experimental results based on five real industry designs show that the first routing algorithm in the literature for the preassignment flip-chip routing problem with a predefined netlist among pads and wire-width and signal-skew considerations can achieve 100% routability and the optimal global-routing wirelength, under reasonable central-processing-unit times.