1 / 24

Crosstalk Driven Routing Resource Assignment

Crosstalk Driven Routing Resource Assignment. Hailong Yao; Qiang Zhou; Xianlong Hong; Yici Cai; EDA Lab., Dept. of Computer Science Tsinghua University, Beijing, China ISCAS’04. Agenda. Introduction Preliminaries Crosstalk Model The CDRRA Algorithm Experimental Results Conclusions.

drago
Download Presentation

Crosstalk Driven Routing Resource Assignment

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. Crosstalk Driven Routing Resource Assignment Hailong Yao; Qiang Zhou; Xianlong Hong; Yici Cai; EDA Lab., Dept. of Computer Science Tsinghua University, Beijing, ChinaISCAS’04

  2. Agenda • Introduction • Preliminaries • Crosstalk Model • The CDRRA Algorithm • Experimental Results • Conclusions

  3. Agenda • Introduction • Preliminaries • Crosstalk Model • The CDRRA Algorithm • Experimental Results • Conclusions

  4. Introduction • Routing • Global Routing • Detailed Routing • Crosstalk Driven Routing • Global Routing Stage • Detailed Routing Stage • Intermediate Stage • Track Assignment • Cross Point Assignment Estimation of crosstalk is more accurate but flexibility to control is restricted

  5. Agenda • Introduction • Preliminaries • Crosstalk Model • The CDRRA Algorithm • Experimental Results • Conclusions

  6. Preliminaries(1/3)

  7. Preliminaries(2/3)

  8. Preliminaries(3/3) • Crosstalk • Aggressor • Victim

  9. Agenda • Introduction • Preliminaries • Crosstalk Model • The CDRRA Algorithm • Experimental Results • Conclusions

  10. Crosstalk Model(1/2)

  11. Crosstalk Model(2/2) • Sensitivity rate • A given parameter • Sensitivity matrix S • If Neti is sensitive to Netj, Sij = 1.

  12. Agenda • Introduction • Preliminaries • Crosstalk Model • The CDRRA Algorithm • Experimental Results • Conclusions

  13. Cost • Layer Cost • Obstacle Cost • Net Length Cost

  14. CDRRA Algorithm (1) Read in the sensitivity rate and construct the crosstalk graph (XG). (2) For all the horizontal and vertical slices, DO (3) Construct the interval graph (IG). (4) Construct the real crosstalk graph (RXG). (5) Construct the tracks’ adjacency graph (TAG). (6) Construct the cost matrix for the assignments of net segments onto the routing tracks. (7) Compute the maximum clique in RXG and the maximum independent set in TAG. Calculate the minimum cost assignment solution using the linear assignment algorithm. (8) Update IG, RXG, TAG and the cost matrix according to the assignment results. If RXG is NULL, then go to (9), else go to (7). (9) Compute the maximum clique from IG and assign the net segments onto the remaining routing tracks using the same algorithm until all the net segments are assigned or the routing tracks are not available.

  15. Example

  16. Crosstalk Graph (XG) • V: set of all the nets. • Exg: sensitive relationship. BACK

  17. Interval Graph (IG) • V: set of net segments inside the current slice. • Eig: overlap information. BACK

  18. Real Crosstalk Graph (RXG) • V: set of net segments. • Erxg: overlap length exceeds MAXOL BACK

  19. Track’s Adjacency Graph (TAG) • V: set of routing tracks. • Etag: adjacency information BACK

  20. Assignment Results

  21. Agenda • Introduction • Preliminaries • Crosstalk Model • The CDRRA Algorithm • Experimental Results • Conclusions

  22. Experimental Results

  23. Agenda • Introduction • Preliminaries • Crosstalk Model • The CDRRA Algorithm • Experimental Results • Conclusions

  24. Conclusions • Crosstalk driven routing in intermediate stage: Track Assignment Stage. • Fully utilizes the routing resources. • Improvement Ratio: 37.5% - 69.8%.

More Related