1 / 30

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

Area-I/O Flip-Chip Routing for Chip-Package Co-Design. Jia -Wei Fang, Yao- Wen Chang. Outline. Introduction Problem Formulation The Routing Algorithm Global Routing RDL Routing Experimental Results Conclusions. Introduction.

gilon
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 Jia-Wei Fang, Yao-Wen Chang

  2. Outline • Introduction • Problem Formulation • The Routing Algorithm • Global Routing • RDL Routing • Experimental Results • Conclusions

  3. Introduction • The flip-chip package, is an advanced packaging technology and created for higher integration density and larger I/O counts. • For the flip-chip applications, typically the top metal or an extra metal layer, called a re-distribution layer (RDL), is used to redistribute I/O pads to bump pads without changing the placement of the I/O pads. • Bump balls are placed on the RDL and use the RDL to connect to I/O pads by bump pads.

  4. Introduction • Recent IC’s place I/O pads (buffers) in the whole area of a die, instead of just placing them along the die boundary. • Consequently, this placement results in shorter wirelength, higher chip density, and better signal and power integrity.

  5. Introduction • After floorplanning the circuit blocks and the I/O buffers, we need to route • from the block ports to the I/O pads (chip-level routing), • from the I/O pads to the bump pads (package-level routing).

  6. Outline • Introduction • Problem Formulation • The Routing Algorithm • Global Routing • RDL Routing • Experimental Results • Conclusions

  7. Problem Formulation • Package-level Routing :Let Q be the set of I/O pads, and B be the set of bump pads. For practical applications, each I/O pad is assigned to one bump pad.

  8. Problem Formulation • Chip-level Routing : Let P be the set of block ports. The number of I/O pads is larger than or equal to the number of block ports, i.e., |Q| ≥ |P|, and each block port pi can be assigned to only one I/O pad qj .

  9. Problem Formulation • Problem 1: Given • the number of RDL’s, • a placement of blocks, • I/O pads (buffers), • bump balls the multi-RDL routing problem for chip-package co-design is to assign a set P of block ports to a set Q of I/O pads and connect the I/O pads to a set B of bump pads so that • there is no wire crossing in each RDL, • the design rules for chip-, package-level routing are satisfied, • the total wirelength is minimized.

  10. Outline • Introduction • Problem Formulation • The Routing Algorithm • Global Routing • RDL Routing • Experimental Results • Conclusions

  11. Algorithm Overview • The algorithm consists of two phases: • Global routing based on the minimum-cost maximum-flow (MCMF) formulation [2] • RDL routing based on the passing-point assignment, the net-ordering determination, and the maze routing.

  12. The Routing Algorithm • Global Routing: • Basic Network Formulation • Capacity Assignment • The Cost of Edges • Global-Routing Path Refinement

  13. The Routing Algorithm • Basic Network Formulation • Bump pad Tile node • Intermediate node I/O pad • For a single layer • An edge is constructed between a block port and an I/O pad if the block port is assigned to the I/O pad of the same buffer type. • Each I/O pad connects either to its nearest intermediate node or to its nearest tile node. • And ten type of edges.

  14. The Routing Algorithm • Basic Network Formulation • For a multi-layer • Each I/O pad is first assigned to one RDL and then assigned to a bump pad. • On the other hand, each RDL has its own intermediate nodes and tile nodes and shares the same bump pads. • Note that the number of RDL’s for current technology is very small (say, one or two).

  15. The Routing Algorithm • Basic Network Formulation • And each edge is associated with a (cost, capacity) tuple. • Then the minimum-cost maximum-flow algorithm (MCMF) algorithm can be solved in time O(|rV|2|rE|1/2) [2], where V is the vertex set in the flow network, E denotes the edge set. • Theorem 2: 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.

  16. The Routing Algorithm • Capacity Assignment • The capacity of an edge e is set to 1 for fine type of cases. • The capacity of the incoming edge of an intermediate node equals Cd • If e is an incoming edge of a tile node, then the capacity of e is Ct

  17. The Routing Algorithm • The Cost of Edges • The cost function is defined by • where WL denotes the Manhattan distance between two terminals of an edge, and TL is the length of a tile. • α and β are both integer variables and are only applied to the edges among block ports and I/O pads.

  18. The Routing Algorithm • The Cost of Edges • For example, since there is only one net routing through the grid 1, α is increased by 1. • In the grid 2, the number of associated edges is 2, and thus β is increased by 2. • Since there may be many edges connecting to a block port and an edge passing through several grids, the cost function selects the edge with less wire congestion.

  19. The Routing Algorithm • Global-Routing Path Refinement

  20. The Routing Algorithm • RDL Routing: • Passing-Point Assignment • Net-Ordering Determination • Maze Routing

  21. The Routing Algorithm • Passing-Point Assignment

  22. The Routing Algorithm • Net-Ordering Determination • After the assignment of passing points, each net has its path to pass through each interval. • So we can extend the net-ordering determination algorithm presented in [4] to generate a routing sequence S and can guarantee that each net segment in a tile is routed without intersecting each other.

  23. The Routing Algorithm • Net-Ordering Determination • For example, given an instance shown in Figure 10(a), according to the net ordering determination algorithm, we can obtain the routing sequence S =< (n’1, n1), (n’5, n5), (n’2, n2), (n’3, n3) >.

  24. The Routing Algorithm • Maze Routing • Using maze routing to complete the routing. • According to the net-ordering determination, each net segment in S has to be routed counterclockwise along the boundary.

  25. Outline • Introduction • Problem Formulation • The Routing Algorithm • Global Routing • RDL Routing • Experimental Results • Conclusions

  26. Experimental Results • Compare with WLM[7]

  27. Experimental Results • Result for fc4324

  28. Experimental Results • Compare with [6]

  29. Conclusions • This paper have developed a network-flow based multi-RDL router for the area-I/O flip-chips. • The router can simultaneously handle pin and layer assignment, total wirelength minimization, and chip-package co-design.

  30. Thank you for your attention.

More Related