1 / 19

Parallel and Distributed Processing CSE 8380

Parallel and Distributed Processing CSE 8380. January 25 2005 Session 4. Contents. Interconnection Networks Static IN Dynamic IN. Interconnection Network. Mode of Operation (Synchronous vs. Asynchronous) Control Strategy (Centralized vs. Decentralized)

owena
Télécharger la présentation

Parallel and Distributed Processing CSE 8380

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. Parallel and Distributed ProcessingCSE 8380 January 25 2005 Session 4

  2. Contents • Interconnection Networks • Static IN • Dynamic IN

  3. Interconnection Network • Mode of Operation(Synchronous vs. Asynchronous) • Control Strategy(Centralized vs. Decentralized) • Switching Techniques(Packet switching vs. Circuit switching) • Topology(Static Vs. Dynamic)

  4. Interconnection Network Taxonomy Interconnection Network Dynamic Static Bus-based Switch-based 1-D 2-D HC Crossbar Single Multiple SS MS

  5. Static IN

  6. Static Interconnection Networks • Static (fixed) interconnection networks are characterized by having fixed paths, unidirectional or bi-directional, between processors. • Completely connected networks (CCNs): Number of links: O(N2), delay complexity: O(1). • Limited connected network (LCNs) • Linear arrays • Ring (Loop) networks • Two-dimensional arrays • Tree networks • Cube network

  7. 1 2 6 3 5 4 Examples of Network Topology Ring Linear Array Fully Connected Mesh

  8. Hypercube 100 110 000 01 010 00 0 101 10 11 111 1 011 001 d = 0 d = 1 d = 2 d = 3

  9. Hypercube of dimension d n = 2d d = log n Node degree = d Number of bits to label a node = d Diameter = d Number of edges = n*d/2 Hamming distance! Routing

  10. 1110 1111 1010 1011 0110 0111 0010 0011 S 1101 1010 1000 1001 0100 0101 0010 0000 0001 d = 4 Hypercubes

  11. Analysis and performance metricsstatic networks

  12. Dynamic IN

  13. C C C P P P P P P Bus Based IN Global Memory Global Memory

  14. Dynamic Interconnection NetworkCrossbar network M1 M2 M3 M4 M5 M6 M7 M8 P1 P2 P3 P4 P5 P6 P7 P8 An 8X8 Crossbar Network

  15. Straight Exchange Upper-broadcast Lower-broadcast The different setting of the 2X2 SE Dynamic Networks

  16. Multi-stage network 000 000 001 001 010 010 011 011 100 100 101 101 110 110 111 111

  17. Dynamic Interconnection NetworkMulti-stage INs (MINs) 000 000 001 001 010 010 011 011 100 100 101 101 110 110 111 111 An example 8X8 Shuffle-Exchange network (SEN).

  18. Dynamic Interconnection NetworkMulti-stage INs (MINs) (cont.) An 8X8 Banyan network

  19. Analysis and performance metricsdynamic networks

More Related