1 / 24

Area-I/O Flip-Chip Routing for Chip-Package Co-Design

Area-I/O Flip-Chip Routing for Chip-Package Co-Design. Progress Report 方家偉、張耀文、何冠賢. The Electronic Design Automation Laboratory Graduate Institute of Electronics Engineering National Taiwan University October 24, 2008. Outline. Contributions Introduction Problem Formulation

mahola
Download Presentation

Area-I/O Flip-Chip Routing for Chip-Package Co-Design

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Area-I/O Flip-Chip Routing for Chip-Package Co-Design Progress Report 方家偉、張耀文、何冠賢 The Electronic Design Automation Laboratory Graduate Institute of Electronics Engineering National Taiwan University October 24, 2008

  2. Outline • Contributions • Introduction • Problem Formulation • The Routing Algorithm • Conclusions

  3. Outline • Contributions • Introduction • Problem Formulation • The Routing Algorithm • Conclusions

  4. Contributions • Present thefirstArea-I/O RDL routing algorithm for chip-package co-design in the literature • Propose a network-flow based routing algorithm • Consider multi-RDL assignment • Extra consider the assignment among block ports and I/O pads • Try to achieve 100% RDL routability and the optimal global-routing wirelength

  5. Outline • Contributions • Introduction • Problem Formulation • The Routing Algorithm • Conclusions

  6. Flip-Chip Technology • Provides a high chip-density solution to the demand for more I/O pads of VLSI designs • Is popular for high-speed and low-power applications • Lower power consumption • Smaller delay • Smaller inductance effect Bump pad Flip-Chip (Die) I/O pad (I/O buffer) Bump ball Flip-Chip Package

  7. Bump pad I/O pad RDL routing example Flip-Chip Routing • In modern flip-chip designs, place the I/O pads into the whole area of the die • Use extra metal layers, called Re-Distribution Layers (RDL’s), to redistribute the I/O padsto the bump pads • Apply an RDL router to route the I/O pads to the bump pads Cross section of RDL

  8. Chip-Package Co-Design • Extra consider the assignment among block ports and I/O pads • Allow an RDL router to choose a proper I/O buffer for each net • Have more flexibility to place blocks and I/O buffers • Reduce the constraints from the connections between block ports and I/O buffers to have better floorplanning results and shorter CUP times Package Chip Bump pad Block 3 4 3 4 6 6 5 5 1 1 2 2 3 3 6 I/O buffer 2 6 5 5 4 4 1 1 2 Block port I/O pad

  9. Flip-Chip Routing Structure • Interval: two adjacent bump pads • Tile: four adjacent bump pads • li/wj: column i/row j of bump pads Package-level structure Chip-level structure

  10. Outline • Contributions • Introduction • Problem Formulation • The Routing Algorithm • Conclusions

  11. Problem Definition • Problem:Multi-layer pin assignment and Area-I/O RDL routing for chip-package co-design • Inputs: • A die with block ports and I/O pads (buffers in different sizes) • A flip-chip package with bump pads • The number of RDL’s • Design rules • Output:A routing solution without design-rule violation • Objective:Connect all nets to minimize the total wirelength

  12. Outline • Contributions • Introduction • Problem Formulation • The Routing Algorithm • Conclusions

  13. Blocks (Block Ports), I/O Buffers (I/O Pads), Bump Pads, # RDL’s The Routing Flow Global Routing RDL Routing • 1. Construct a flow network to • simultaneously assign and • route block ports to bump • pads via I/O pads • 2. Consider routing resource • in the flow network to avoid • overflow • 1. Find a routable net order • 2. Refine the global-routing • paths to meet design • rules RDL Routing Result Output Chip-level I/O Netlist Output Chip-level Routing

  14. Blocks (Block Ports), I/O Buffers (I/O Pads), Bump Pads, # RDL’s The Routing Flow Global Routing RDL Routing • 1. Construct a flow network to • simultaneously assign and • route block ports to bump • pads via I/O pads • 2. Consider routing resource • in the flow network to avoid • overflow • 1. Find a routable net order • 2. Refine the global-routing • paths to meet design • rules RDL Routing Result Output Chip-level I/O Netlist Output Chip-level Routing

  15. Intermediate and Tile Nodes Insertion • Tile node: at the middle of each tile • Interval node: at the middle of each interval Intermediate node Bump pad Tile node I/O pad

  16. Basic Network Formulation • Min-Cost Max-Flow (MCMF) Algorithm (Concurrent Assignment) • Nodes:block port p∈ P, I/O pad q∈ Q, bump pad b∈ B, intermediate node d∈ D, tile node t∈ T • Edges: e(p, q), e(q, b), e(q, t), e(q, d), e(d, b), e(d, t), e(t, b), and e(t, d) • Avoid crossing of edges => Avoid crossing of wires • Add intermediate nodes and tile nodes to avoid wire congestion Vertical view Cross section b Bump pad b Tile t d t I/O Pads (Type 1) I/O Pads (Type 2) I/O Pads (Type 3) I/O Pads (Type 4) d Block Port Intermediate node p

  17. 1 Tile node 1 1 q p t b 1 1 I/O pad 1 Ct Cd t s Bump pad 1 1 1 1 q p b d 1 Block port Intermediate node 1 Cost/Capacity Assignment • Basic edge cost=edge length • There are 2/10 types of nodes/edges and their capacities are • Cd/Ct: maximum number of nets allowed to pass an interval/tile • Intermediate node=Cd; Tile node=Ct • e(source, p)=1, e(p, q)=1, e(q, b)=1, e(q, d)=1, e(q, t)=1, e(d, b)=1, e(d, t)=Ct, e(t, b)=1, e(t, d)=Cd,and e(b, sink)=1

  18. Routing Completion Guarantee • Theorem: • Given a set of block ports, a set of I/O pads, and a set of bump pads, if there exists a feasible solution computed by the MCMF algorithm, we can guarantee 100% RDL routing completion Package-level Chip-level Bump pad Block 3 4 3 4 6 6 5 5 1 1 2 2 3 3 6 I/O buffer 2 6 5 5 4 4 1 1 2 Block port I/O pad

  19. Blocks (Block Ports), I/O Buffers (I/O Pads), Bump Pads, # RDL’s The Routing Flow Global Routing RDL Routing • 1. Construct a flow network to • simultaneously assign and • route block ports to bump • pads via I/O pads • 2. Consider routing resource • in the flow network to avoid • overflow • 1. Find a routable net order • 2. Refine the global-routing • paths to meet design • rules RDL Routing Result Output Chip-level I/O Netlist Output Chip-level Routing

  20. Passing-Point Assignment • After network solving, split edges to get independent nets without any wire crossing • According to the flows passing each tile node, refine edges • Split each intermediate node and edge to get final global-routing paths :Edges :Bump Pads :Intermediate Nodes :Passing Points :Net Segments :I/O Pads 5 2 2 1 2 3 4 1 1 Flow 2 3 4 4 4 1 1 1 2 1 1 1 3 1 3 5 1 Tile Node 2 2 4 4 5 3

  21. Net Ordering Determination and Maze Routing • Modify the net ordering determination (Hsu, in DAC-83) • Consist of 3 steps • Step 1: redraw the boundary • Step 2: decide the source s and destination d for each wire • Step 3: decide the net ordering by a stack • Apply maze routing :Bump Pad :I/O Pad :Passing Point :Net Segment 1’ 5 2’ 3’ 5 1’ 2’ 3’ 4’ 1’ 2’ 3’ 4’ s s s 4 4 1 d 1 d 5’ 5’ 2 d 2 s d 5 5 3 3

  22. Outline • Introduction • Problem Formulation • The Routing Algorithm • Conclusions

  23. Conclusions • Propose a flip-chip router for chip-package co-design considering I/O assignment and total wirelength minimization • Try to achieve 100% RDL routability and the optimal global-routing wirelength by using network flow

  24. Schedule • Stage 1 (1/2008 – 4/2008): done • Literature survey • Development of a placement and routing algorithm considering the objectives • Stage 2 (5/2008 – 7/2008): done • Implementation of the placement and routing algorithm • Stage 3 (8/2008 – 9/2008): done • Optimization of the objectives • Stage 4-1 (9/2008 – 11/2008): done • GUI generation and integration of all functions • Paper writing and documentation • (Extra)Stage 4-2 (9/2008 – ) • Extensions to Etron designs • (Extra)Stage 4-3 (9/2008 – ) • Study the Area-I/O Flip-Chip Routing for Chip-Package Co-Design

More Related