1 / 9

Jinho Lee and Kiyoung Choi NOCS 2013. 04. 22 Design Automation Lab, SNU

A Deadlock-Free Routing Algorithm Requiring No Virtual Channel on 3D-NoCs with Partial Vertical Connections. Jinho Lee and Kiyoung Choi NOCS 2013. 04. 22 Design Automation Lab, SNU. Introduction. 3D integration Stacking multiple dies over others

beck-davenport
Download Presentation

Jinho Lee and Kiyoung Choi NOCS 2013. 04. 22 Design Automation Lab, SNU

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. A Deadlock-Free Routing Algorithm Requiring No Virtual Channel on 3D-NoCs with Partial Vertical Connections Jinho Lee and Kiyoung Choi NOCS 2013. 04. 22 Design Automation Lab, SNU

  2. Introduction • 3D integration • Stacking multiple dies over others • New trend for high performance and low energy Analog DRAM SRAM • 3D NoC also necessary Logic

  3. Introduction • We assume 3D Mesh with partial vertical connection. • To reduce total number of TSVs • TSV consumes silicon area • To recover TSV fault • Full 3D mesh becomes partially connected mesh

  4. In this work… • We present a deadlock-free routing algorithm with no virtual channel for 3D network. • Related work • Up*/Down* routing [1] • Tree-based topology-agnostic routing. • Poor performance • Elevator-first routing [2] • Connectsarbitrary 2D networks. • Uses two virtual channels. • Split virtual channels into upward and downward channels. [1] M.D. Schroeder et al., “Autonet: a high-speed, self-configuring local area network using point-to-point links.” [2] F. Dubois et al., “Elevator-First: a deadlock-free distributed routing algorithm for vertically partially connected 3D-NoCs.”

  5. Elevator-first Routing • Route packet to an elevator (vertical link). • Take the elevator to another layer. • Route packet to destination. • Our algorithm suggests rules for selecting appropriate elevator. • It is deadlock-free without virtual channel.

  6. Rules for Selecting Vertical Link • Using XY routing as basis • Rule 2: If there is no south-or-due-east vertical link, take the most south-east vertical link (pivot). • Rule 1: Take the nearest south-or-due-east vertical link. S S “Up” pivot

  7. Rules for Selecting Vertical Link (2) • Rule 3: If down elevator chosen by rule 1 is placed south-or-due-east of up pivot, take down pivot S “Down” pivot “Up” pivot

  8. Experimental Result • Compared to original elevator-first: • Saturation point : 8.4% higher • Peak agg. throughput : 13.7% higher • Saturated agg. throughput : 31.2% higher • Low peak energy : 8.0 % less • Saturated energy : 27.7% less

  9. At the poster, you can find… • More detailed rules • Sketch of the proofs • Questions?

More Related