Presentation is loading. Please wait.

Presentation is loading. Please wait.

Semi-Detailed Bus Routing with Variation Reduction Fan Mo, Synplicity Robert Brayton, UC Berkeley Presented by: Philip Chong, Cadence.

Similar presentations


Presentation on theme: "Semi-Detailed Bus Routing with Variation Reduction Fan Mo, Synplicity Robert Brayton, UC Berkeley Presented by: Philip Chong, Cadence."— Presentation transcript:

1 Semi-Detailed Bus Routing with Variation Reduction Fan Mo, Synplicity Robert Brayton, UC Berkeley Presented by: Philip Chong, Cadence

2 Outline Why bus routing. The orientation determination problem. Bus routing flow overview. The algorithm. Experimental results. Future work.

3 Why Bus Routing Bit-wise wire length/delay matching. Save runtime. –Routing a representative bit (what we call virtual net). Usually better routability –Less twisting and entangling. Better variation immunity. –All bits receive similar variations.

4 Existing Bus Routers Route a representative bit rather than all bits. –Persky and Tran, DAC 84 Fanout-1 bus –Rafiq et al, ISPD 02 0-bend, 1-bend, 2-bend bus topologies. –Xiang et al, DAC 03 –Law and Young, ISPD 05 –Chen and Chang, ISPD 05

5 The Turning Points! The arrangement of the turning points is the key to successful bus routing.

6 The Node Orientation The virtual net –An abstract view of the bus. –Bused pins become pin nodes. –All other points become non-pin nodes. The arrangement of the bits at a node is called the orientation. –The direction from LSB towards MSB.

7 Orientation and Orientation Set A pin node has a fixed orientation. –Always 0 o or 90 o (N, W, S or E) A non-pin node may have several possible orientations. –Always 45 o (NE, NW, SE, SW) All possible orientations of a node form an orientation set. pin nodes Or.Set (single orientation) non-pin nodes Or.Set NWNESWSENHEVSHWV TPTNAL

8 Orientation and Orientation Set Adjacent nodes must have compatible orientation sets. empty orientation set

9 Orientation and Orientation Set Special case: Interlocking. –When two non-pin nodes are connected by a short segment, the connection must be a Z-shape. –The orientation sets of the two nodes are interlocked. What is short? Distance less than the all-bit routing width of the bus.

10 Bus Routing Flow

11 The Algorithm

12 Step 1: Preparation

13 The Algorithm Step 2: Virtual net routing

14 The Algorithm Step 3: Orientation set generation

15 The Algorithm Step 4: Fix –Add extra blockage to avoid using certain segments. –Re-route (Step 2). –Redo orientation set generation (Step 3). –Try a few times. If still fails, abort.

16 The Algorithm Step 5: Orientation determination and deviation reduction –A forward propagation from the driver pin node can determine the orientation for each node (from its orientation set). –Flexibility may exist, if for certain nodes, more than one orientation are valid choices. –Such flexibility allows minimization of bit- wise driver-load wire length/delay deviation. Bit-wise wire length deviation = the (absolute) difference between MSB driver-load length and LSB driver-load length.

17 The Algorithm Step 5: Orientation determination and deviation reduction –No minimization: One round of forward propagation determines the orientations for all nodes. Complexity O(U), where U is number of nodes. orientation setsno minimization

18 The Algorithm Step 5: Orientation determination and deviation reduction –Minimizing total/maximum deviation: Implicitly enumerate possible combinations and pick the best one. Complexity O(F×U), where F is fanout. minimizing max deviationminimizing total deviation

19 The Algorithm methodtotal deviation max deviation no minimization11Δ3Δ3Δ minimizing total deviation5Δ5Δ3Δ3Δ minimizing max deviation7Δ7Δ2Δ2Δ Step 5: Orientation determination and deviation reduction

20 Experimental Results unit-tests (single bus routing) –Bit-width=8,16,32,64. –Fanout=1~16. –0~2 random routing blockages. Our bus router (this) is compared with a bus-aware reference router (rrouter).

21 Experimental Results 1 Success rate. both routers succeed this succeed only rrouter succeed only both fail

22 Experimental Results 1 this vs rrouter Run time: 20X faster. Wire length: Better when fanout<11; 2% longer when fanout approaches 16. Ave. driver-load wire length deviation: 188% less. Max. driver-load wire length deviation: 469% less. Ave. driver-load delay deviation: 286% less. Max. driver-load delay deviation: 273% less.

23 Experimental Results 1 Under variation. rrouter has max bit-wise delay deviation of 25ps, while this has only 7ps.

24 Experimental Results 2 Comparison of two flows -the reference router (rrouter) -our router routes bus, forward annotate and then the reference router finishes the rest (this+rr) total wire length ( m) #viaruntime (min:sec) designrrouterthis+rrrrouterthis+rrrrouterthis+rr A :253:27 A :114:45 A :251:10 A :593:54 A :574:08 Total wire length and via number 5 real designs. 0.5% shorter25% less7.5% faster

25 Experimental Results 2 average deviationmaximum deviationmax dev w/ variation designrrouterthis+rrrrouterthis+rrrrouterthis+rr A A A A A Average/max driver-load delay deviations (ps) (buses only) 3X smaller6X smaller

26 Experimental Results 2 Final routing of design A4 by rrouter

27 Experimental Results 2 Final routing of design A4 by this+rr

28 Future Work Embed the algorithm in floorplanning, global routing … Bus validity checking for designers manually floorplanning modules.


Download ppt "Semi-Detailed Bus Routing with Variation Reduction Fan Mo, Synplicity Robert Brayton, UC Berkeley Presented by: Philip Chong, Cadence."

Similar presentations


Ads by Google