Download presentation
Presentation is loading. Please wait.
Published byDarlene Morton Modified over 9 years ago
1
Computer Science and Engineering Copyright by Hesham El-Rewini Advanced Computer Architecture CSE 8383 February 16 2006 Session 10
2
Computer Science and Engineering Copyright by Hesham El-Rewini Contents Dynamic Networks Bus based systems Switch based systems
3
Computer Science and Engineering Copyright by Hesham El-Rewini Interconnection Network Static Dynamic Bus-basedSwitch-based 1-D2-DHC SingleMultiple SSMS Crossbar
4
Computer Science and Engineering Copyright by Hesham El-Rewini Dynamic Network Analysis Parameters: Cost Delay: latency Blocking characteristics Fault tolerance
5
Computer Science and Engineering Copyright by Hesham El-Rewini Bus Based IN Global Memory P P C P C P C P P
6
Computer Science and Engineering Copyright by Hesham El-Rewini Dynamic Interconnection Networks Communication patterns are based on program demands Connections are established on the fly during program execution Multistage Interconnection Network (MIN) and Crossbar
7
Computer Science and Engineering Copyright by Hesham El-Rewini Switch Modules A x B switch module A inputs and B outputs In practice, A = B = power of 2 Each input is connected to one or more outputs (conflicts must be avoided) One-to-one (permutation) and one-to- many are allowed
8
Computer Science and Engineering Copyright by Hesham El-Rewini Binary Switch 2x2 Switch Legitimate States = 4 Permutation Connections = 2
9
Computer Science and Engineering Copyright by Hesham El-Rewini Legitimate Connections StraightExchange Upper-broadcast Lower-broadcast The different setting of the 2X2 SE
10
Computer Science and Engineering Copyright by Hesham El-Rewini Group Work General Case ??
11
Computer Science and Engineering Copyright by Hesham El-Rewini Multistage Interconnection Networks ISC1 ISC2 ISCn switches ISC Inter-stage Connection Patterns
12
Computer Science and Engineering Copyright by Hesham El-Rewini Perfect-Shuffle Routing Function Given x = {a n, a n-1, …, a 2, a 1 } P(x) = {a n-1, …, a 2, a 1, a n } X = 110001 P(x) = 100011
13
Computer Science and Engineering Copyright by Hesham El-Rewini Perfect Shuffle Example 000 000 001 010 010 100 011 110 100 001 101 011 110 101 111 111
14
Computer Science and Engineering Copyright by Hesham El-Rewini Perfect-Shuffle 000 001 010 011 100 101 110 111 000 001 010 011 100 101 110 111
15
Computer Science and Engineering Copyright by Hesham El-Rewini Exchange Routing Function Given x = {a n, a n-1, …, a 2, a 1 } E i (x) = {a n, a n-1, …, a i, …, a 2, a 1 } X = 0000000 E 3 (x) = 0000100
16
Computer Science and Engineering Copyright by Hesham El-Rewini Exchange E 1 000 001 001 000 010 011 011 010 100 101 101 100 110 111 111 110
17
Computer Science and Engineering Copyright by Hesham El-Rewini Exchange E 1 000 001 010 011 100 101 110 111 000 001 010 011 100 101 110 111
18
Computer Science and Engineering Copyright by Hesham El-Rewini Butterfly Routing Function Given x = {a n, a n-1, …, a 2, a 1 } B(x) = {a 1, a n-1, …, a 2, a n } X = 010001 P(x) = 110000
19
Computer Science and Engineering Copyright by Hesham El-Rewini Butterfly Example 000 000 001 100 010 010 011 110 100 001 101 101 110 011 111 111
20
Computer Science and Engineering Copyright by Hesham El-Rewini Butterfly 000 001 010 011 100 101 110 111 000 001 010 011 100 101 110 111
21
Computer Science and Engineering Copyright by Hesham El-Rewini Multi-stage network 000 001 010 011 100 101 110 111 000 001 010 011 100 101 110 111
22
Computer Science and Engineering Copyright by Hesham El-Rewini MIN (cont.) An 8X8 Banyan network
23
Computer Science and Engineering Copyright by Hesham El-Rewini Min Implementation Control (X) Source (S) Destination (D) X = f(S,D)
24
Computer Science and Engineering Copyright by Hesham El-Rewini Example X = 0 X = 1 ( crossed ) (straight ) A B C D A B C D
25
Computer Science and Engineering Copyright by Hesham El-Rewini Consider this MIN S1 S2 S3 S4 S5 S6 S7 S8 D1 D2 D3 D4 D5 D6 D7 D8 stage 1 stage 2 stage 3
26
Computer Science and Engineering Copyright by Hesham El-Rewini Example (Cont.) Let control variable be X 1, X 2, X 3 Find the values of X 1, X 2, X 3 to connect: S1 D6 S7 D5 S4 D1
27
Computer Science and Engineering Copyright by Hesham El-Rewini The 3 connections S1 S2 S3 S4 S5 S6 S7 S8 D1 D2 D3 D4 D5 D6 D7 D8 stage 1 stage 2 stage 3
28
Computer Science and Engineering Copyright by Hesham El-Rewini Boolean Functions X = x 1, x 2, x 3 S = s 2, s 2, s 3 D = d 1, d 2, d 3 Find X = f(S,D)
29
Computer Science and Engineering Copyright by Hesham El-Rewini Crossbar Switch M1 M2 M3 M4 M5 M6 M7 M8 P1 P2 P3 P4 P5 P6 P7 P8
30
Computer Science and Engineering Copyright by Hesham El-Rewini Analysis and performance metrics dynamic networks NetworksDelayCostBlockingDegree of FT BusO(N)O(1)Yes0 Multiple-busO(mN)O(m)Yes(m-1) MINO(logN)O(NlogN)Yes0 CrossbarO(1)O(N 2 )No0
Similar presentations
© 2024 SlidePlayer.com. Inc.
All rights reserved.