1 / 10

Multi-Node Broadcasting in a Wormhole-Routed 2-D Torus

Multi-Node Broadcasting in a Wormhole-Routed 2-D Torus. Director: Yuh-Shyan Chen Presenter: Jerry Chen. Reference: http://www.cs.chu.edu.tw/~jerry. Question, mail to me: jerry@cs.chu.edu.tw. Outline. Introduction Prelimiaries Our broadcast scheme Packet collect. Diagonal broadcast.

benjy
Download Presentation

Multi-Node Broadcasting in a Wormhole-Routed 2-D Torus

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. Multi-Node Broadcasting in a Wormhole-Routed 2-D Torus Director: Yuh-Shyan Chen Presenter: Jerry Chen Reference: http://www.cs.chu.edu.tw/~jerry Question, mail to me: jerry@cs.chu.edu.tw

  2. Outline • Introduction • Prelimiaries • Our broadcast scheme • Packet collect. • Diagonal broadcast. • Sub-torus broadcast. • Future work

  3. Introduction • Mesh vs Torus. 4x4 Mesh and 4x4 Torus.

  4. Introduction • Broadcast (one-to-one, all-to-all, one-to-all). • Multi-Node Broadcast. • Wormhole-routed: message is partition into flits. The header lead the routing. Data flits follow header in a pipelined fashion. • X-Y routing (+X,+Y), (-X,+Y), (+X,-Y) and (-X,-Y). • Network partition. Sub-torus size.

  5. Introduction • Data-Distributing Network (DDN) and Data-Collecting Network (DCN).

  6. Preliminaries • Source nodes are locating in arbitrary position. • Assume each source node has one packet. • Source nodes may be located in some worst case, like as located at the same row or column, or mesh style. • Congestion. • Load balance.

  7. Packet collect • We use multi-diagonals to collect distributed source packets. • The beside of diagonal (left and right node) and node below of diagonal (dilated-2) to send its packet to diagonal. • Assume the diagonal node is Pi,jand it will receive Pi-1,j, Pi+1,j, and Pi,j+2 packets. • Example: P4,4 will receive P3,4, P5,4, and P4,6. • Each diagonal node may save maximum 4 packets when sub-torus=4.

  8. Diagonal Broadcast • After packet collect, the main diagonal have whole source node packets. Use multi-diagonal concept again, the main diagonal send packets to other diagonal. • It use whole link of diagonal node to send packets. • To left and right use dilated-h. • To upper and below use dilated-2h.

  9. Sub-torus Broadcast • First two diagonal node send its packets to each other. • The diagonal nodes send packets to four ways neighbor node. • Pi,i+1 diagonal send whole packets to dilated-1 neighbor node and Pi,i-1 diagonal send partial packets to main diagonal. • Total cost 3-steps at sub-torus=4.

  10. Future Work • Torus not square. • Decide a best sub-torus size at any situation. • Optimal rule of sub-torus broadcast at any size. • Time complexity calculate. • Performance Analysis

More Related