2
Most read
8
Most read
19
Most read
PARALLEL AND DISTRIBUTED COMPUTING
INTERCONNECTION TOPOLOGIES
NETWORK TOPOLOGIES
Two types of topologies
 Shared Network: Communicate at most one message at a
time that’s why limited scalability
 Switched Network: Simultaneously transfer several messages
between different pairs of nodes.
NETWORK TOPOLOGIES
 Degree: Maximum number of neighbors of any node
 Diameter: length of longest of all shortest path
 BisectionWidth: minimum number of edges(links) to be
removed to disconnect the network into two halves. In case of
odd number of nodes one half can include one more node.
NETWORK TOPOLOGIES
 Constant Degree: Should be constant i.e. independent of
network size.This property allows scale large number of nodes
without adding excessive number of connections.
 Low Diameter: Should be minimum in order to provide
efficient communication between any pair of nodes
 High BisectionWidth: low bisection width can slow down
communication and thus limit the performance of applications.
Parallel and Distributed Computing Chapter 11
NETWORK TOPOLOGIES
 Linear Array
 2D Mesh/torus
 3D Mesh/torus
 BinaryTree
 Hypercube
LINEAR ARRAY
 Every node is connected to left and its right neighbor and thus
degree is 2 i.e. deg(Ln)=2
 Longest distance between any two nodes is between leftmost
node and the right most node i.e. Diam(Ln)=n-1
 Bisection width is one i.e. BW(Ln)=1, Since only one link
between P(n-1)/2 and P(n/2) needs to be removed in order to split
into two disconnected halves.
2D MESHTOPOLOGY
 Nodes are arranged in a (usually
square) grid
 Each node has most four neighbors i.e.
deg(M4,4)=√n=4
 Longest distance between P0,0 and P3,3
Leading to diameter of 6 i.e.
Daim(Mk,k)=2(√n-1)=6.
 Removing all links between second
and third row/column disconnects
M4,4 into equal halves.Thus bisection
width is bw(Mk,k)=(√n =4)
2D TORUSTOPOLOGY
 A frequently used extension of mesh is torus
 2D Torus Tk,k is extends Mk,k by adding wrap-around
edges to directly connect left and right node of each
raw as well the bottom and top node of each
column.
 Each node has most four neighbors i.e. deg(M4,4)=4
 Longest distance between P0,0 and P3,3 Leading to
diameter of 6 i.e. Daim(Mk,k)=(√n-1)=3.
 Removing all links between second and third
row/column disconnects M4,4 into equal halves.Thus
bisection width is bw(Mk,k)=(2√n = 8)
3D MESHTOPOLOGY
 Nodes are arranged in a (usually
square) grid
 Each node has most six neighbors
i.e. degree is Deg(Mk,k,k)=6
 Longest distance between P0,0 and
P3,3 Leading to diameter of 6 i.e.
Daim(Mk,k,k)=3(3√n-1).
 Bisection width can be calculated as
BW(Mk,k)=( n2/3)
3D MESHTOPOLOGY
 3D Mesh topology has many desirable features such as a
constant degree, relatively low diameter, and relatively high
bisection width.
 Thus it has been used as an interconnection network in top
supercomputers
3D TORUSTOPOLOGY
 Nodes are arranged in a (usually
square) grid
 Similar to 3d-Mesh topology just by
adding wrap-around edges
BINARY TREE TOPOLOGY
 In order to reduce network diameter, a tree based structure can be
used.
 Each node is connected to its parent and two Childs hence degree
is deg(BTd)=3
 The longest distance is when travelling between left most node to
right most half of tree, which requires growing up to the root and
then down again so Diam(BTd) = 2(d-1) = 2log2 (n+1).
 In-spite of constant degree and diameter is low disadvantage of
binary tree is its bisection width.
BINARY TREE TOPOLOGY
 Removing only a single link
with the root, we can split
the network into two
disconnected components
i.e. bitwise width bw(BTd)=1
HYPERCUBE NETWORK TOPOLOGY
 Hypercube network can be
represented as a graph with
n=2d nodes that has each
vertex labeled with a distinct
bit of length d
 Vertices that are connected iff
bits string differ in exactly one
bit.
Parallel and Distributed Computing Chapter 11
HYPERCUBE NETWORK TOPOLOGY
 Each node is connected to d
other nodes so degree will
deg(Qd)=d=log2(n)
 Longest distance between two
nodes diam(Qd)=d=log2(n)
 Removing all links between nodes
starting with label O and all
nodes starting with 1
disconnects Hd into two halves
i.e. it holds bw(Qd)=n/2
NETWORK TOPOLOGY
HYPERCUBE NETWORK TOPOLOGY
 Overall hypercube has the highest bisection width
 Furthermore diameter is very low (logarithmic)
 But disadvantage is non constant degree. i.e. number of required
links per node is logarithmic
 Making it difficult to scale up to large number of nodes.

More Related Content

PPT
Unit 3 Network Layer PPT
PPTX
Load Balancing In Distributed Computing
PDF
Parallel and Distributed Computing Chapter 8
PPT
aloha
PDF
Parallel and Distributed Computing Chapter 10
PPTX
5.2.2. Memory Consistency Models.pptx
PDF
Parallel and Distributed Computing Chapter 12
PPT
Unit 3 Network Layer PPT
Load Balancing In Distributed Computing
Parallel and Distributed Computing Chapter 8
aloha
Parallel and Distributed Computing Chapter 10
5.2.2. Memory Consistency Models.pptx
Parallel and Distributed Computing Chapter 12

What's hot (20)

PPT
Lamport’s algorithm for mutual exclusion
PDF
Processes and Processors in Distributed Systems
PPTX
Lecture 2 - Asynchrnous and Synchronous Computation & Communication.pptx
PDF
Interconnection Network
PPT
All-Reduce and Prefix-Sum Operations
PDF
Lecture 03 - Synchronous and Asynchronous Communication - Concurrency - Fault...
PPT
SMTP – Simple Mail Transfer Protocol | Explained for Beginners
PDF
Open mp
PPTX
Address resolution protocol (ARP)
PPT
data-link layer protocols
PPTX
Multiple Access Protocal
PPT
Flynns classification
PPTX
Operating system critical section
PPTX
Multicast routing
PPTX
Multiprocessor system
PPTX
Parallel algorithms
PDF
Ipv6 packet fomat
PPTX
Multithreading computer architecture
PDF
Parallel and Distributed Computing chapter 3
Lamport’s algorithm for mutual exclusion
Processes and Processors in Distributed Systems
Lecture 2 - Asynchrnous and Synchronous Computation & Communication.pptx
Interconnection Network
All-Reduce and Prefix-Sum Operations
Lecture 03 - Synchronous and Asynchronous Communication - Concurrency - Fault...
SMTP – Simple Mail Transfer Protocol | Explained for Beginners
Open mp
Address resolution protocol (ARP)
data-link layer protocols
Multiple Access Protocal
Flynns classification
Operating system critical section
Multicast routing
Multiprocessor system
Parallel algorithms
Ipv6 packet fomat
Multithreading computer architecture
Parallel and Distributed Computing chapter 3
Ad

Similar to Parallel and Distributed Computing Chapter 11 (20)

PPT
Parallel computing chapter 2
PPT
system interconnect architectures in ACA
PPT
Icaet latifah ppt
PDF
Static networks
PDF
Outage performance users located outside D2D coverage area in downlink cellul...
PDF
RZ based dispersion compensation technique in dwdm system for broadband spectrum
PDF
Iisrt 1-rz based dispersion compensation technique in dwdm system for broadba...
PDF
RZ based dispersion compensation technique in dwdm system for broadband spectrum
PDF
Notes on optical fiber communication unit7
PDF
ON FINDING MINIMUM AND MAXIMUM PATH LENGTH IN GRID-BASED WIRELESS NETWORKS
PPT
dokumen.tips_3d-ic-seminar-ppt.ppt
PDF
A Compact Dual Band Dielectric Resonator Antenna For Wireless Applications
PPT
3D IC TECHNOLOGY
PPTX
Network Measures: Characterizing networks
PDF
FIBEROPTICS.pdf
PPT
PPTX
GSM Cell planning and frequency reuse
PDF
Dual band cross-coupled branch line coupler
PPT
What Is A Network made by Ms. Archika Bhatia
Parallel computing chapter 2
system interconnect architectures in ACA
Icaet latifah ppt
Static networks
Outage performance users located outside D2D coverage area in downlink cellul...
RZ based dispersion compensation technique in dwdm system for broadband spectrum
Iisrt 1-rz based dispersion compensation technique in dwdm system for broadba...
RZ based dispersion compensation technique in dwdm system for broadband spectrum
Notes on optical fiber communication unit7
ON FINDING MINIMUM AND MAXIMUM PATH LENGTH IN GRID-BASED WIRELESS NETWORKS
dokumen.tips_3d-ic-seminar-ppt.ppt
A Compact Dual Band Dielectric Resonator Antenna For Wireless Applications
3D IC TECHNOLOGY
Network Measures: Characterizing networks
FIBEROPTICS.pdf
GSM Cell planning and frequency reuse
Dual band cross-coupled branch line coupler
What Is A Network made by Ms. Archika Bhatia
Ad

More from AbdullahMunir32 (16)

PDF
Mobile Application Development-Lecture 15 & 16.pdf
PDF
Mobile Application Development-Lecture 13 & 14.pdf
PDF
Mobile Application Development -Lecture 11 & 12.pdf
PDF
Mobile Application Development -Lecture 09 & 10.pdf
PDF
Mobile Application Development -Lecture 07 & 08.pdf
PDF
Mobile Application Development Lecture 05 & 06.pdf
PDF
Mobile Application Development-Lecture 03 & 04.pdf
PDF
Mobile Application Development-Lecture 01 & 02.pdf
PDF
Parallel and Distributed Computing Chapter 13
PDF
Parallel and Distributed Computing Chapter 9
PDF
Parallel and Distributed Computing Chapter 7
PDF
Parallel and Distributed Computing Chapter 6
PDF
Parallel and Distributed Computing Chapter 5
PDF
Parallel and Distributed Computing Chapter 4
PDF
Parallel and Distributed Computing Chapter 2
PDF
Parallel and Distributed Computing chapter 1
Mobile Application Development-Lecture 15 & 16.pdf
Mobile Application Development-Lecture 13 & 14.pdf
Mobile Application Development -Lecture 11 & 12.pdf
Mobile Application Development -Lecture 09 & 10.pdf
Mobile Application Development -Lecture 07 & 08.pdf
Mobile Application Development Lecture 05 & 06.pdf
Mobile Application Development-Lecture 03 & 04.pdf
Mobile Application Development-Lecture 01 & 02.pdf
Parallel and Distributed Computing Chapter 13
Parallel and Distributed Computing Chapter 9
Parallel and Distributed Computing Chapter 7
Parallel and Distributed Computing Chapter 6
Parallel and Distributed Computing Chapter 5
Parallel and Distributed Computing Chapter 4
Parallel and Distributed Computing Chapter 2
Parallel and Distributed Computing chapter 1

Recently uploaded (20)

PDF
Environmental Education MCQ BD2EE - Share Source.pdf
PPTX
ELIAS-SEZIURE AND EPilepsy semmioan session.pptx
PDF
plant tissues class 6-7 mcqs chatgpt.pdf
PDF
Journal of Dental Science - UDMY (2020).pdf
PDF
AI-driven educational solutions for real-life interventions in the Philippine...
PDF
Skin Care and Cosmetic Ingredients Dictionary ( PDFDrive ).pdf
PPTX
Core Concepts of Personalized Learning and Virtual Learning Environments
PDF
1.3 FINAL REVISED K-10 PE and Health CG 2023 Grades 4-10 (1).pdf
PDF
semiconductor packaging in vlsi design fab
PDF
My India Quiz Book_20210205121199924.pdf
PDF
MICROENCAPSULATION_NDDS_BPHARMACY__SEM VII_PCI Syllabus.pdf
PDF
Journal of Dental Science - UDMY (2022).pdf
PDF
LIFE & LIVING TRILOGY - PART - (2) THE PURPOSE OF LIFE.pdf
PPT
REGULATION OF RESPIRATION lecture note 200L [Autosaved]-1-1.ppt
PDF
English Textual Question & Ans (12th Class).pdf
PPTX
Macbeth play - analysis .pptx english lit
PDF
LIFE & LIVING TRILOGY - PART (3) REALITY & MYSTERY.pdf
PDF
Vision Prelims GS PYQ Analysis 2011-2022 www.upscpdf.com.pdf
PPTX
INSTRUMENT AND INSTRUMENTATION PRESENTATION
PPTX
Education and Perspectives of Education.pptx
Environmental Education MCQ BD2EE - Share Source.pdf
ELIAS-SEZIURE AND EPilepsy semmioan session.pptx
plant tissues class 6-7 mcqs chatgpt.pdf
Journal of Dental Science - UDMY (2020).pdf
AI-driven educational solutions for real-life interventions in the Philippine...
Skin Care and Cosmetic Ingredients Dictionary ( PDFDrive ).pdf
Core Concepts of Personalized Learning and Virtual Learning Environments
1.3 FINAL REVISED K-10 PE and Health CG 2023 Grades 4-10 (1).pdf
semiconductor packaging in vlsi design fab
My India Quiz Book_20210205121199924.pdf
MICROENCAPSULATION_NDDS_BPHARMACY__SEM VII_PCI Syllabus.pdf
Journal of Dental Science - UDMY (2022).pdf
LIFE & LIVING TRILOGY - PART - (2) THE PURPOSE OF LIFE.pdf
REGULATION OF RESPIRATION lecture note 200L [Autosaved]-1-1.ppt
English Textual Question & Ans (12th Class).pdf
Macbeth play - analysis .pptx english lit
LIFE & LIVING TRILOGY - PART (3) REALITY & MYSTERY.pdf
Vision Prelims GS PYQ Analysis 2011-2022 www.upscpdf.com.pdf
INSTRUMENT AND INSTRUMENTATION PRESENTATION
Education and Perspectives of Education.pptx

Parallel and Distributed Computing Chapter 11

  • 1. PARALLEL AND DISTRIBUTED COMPUTING INTERCONNECTION TOPOLOGIES
  • 2. NETWORK TOPOLOGIES Two types of topologies  Shared Network: Communicate at most one message at a time that’s why limited scalability  Switched Network: Simultaneously transfer several messages between different pairs of nodes.
  • 3. NETWORK TOPOLOGIES  Degree: Maximum number of neighbors of any node  Diameter: length of longest of all shortest path  BisectionWidth: minimum number of edges(links) to be removed to disconnect the network into two halves. In case of odd number of nodes one half can include one more node.
  • 4. NETWORK TOPOLOGIES  Constant Degree: Should be constant i.e. independent of network size.This property allows scale large number of nodes without adding excessive number of connections.  Low Diameter: Should be minimum in order to provide efficient communication between any pair of nodes  High BisectionWidth: low bisection width can slow down communication and thus limit the performance of applications.
  • 6. NETWORK TOPOLOGIES  Linear Array  2D Mesh/torus  3D Mesh/torus  BinaryTree  Hypercube
  • 7. LINEAR ARRAY  Every node is connected to left and its right neighbor and thus degree is 2 i.e. deg(Ln)=2  Longest distance between any two nodes is between leftmost node and the right most node i.e. Diam(Ln)=n-1  Bisection width is one i.e. BW(Ln)=1, Since only one link between P(n-1)/2 and P(n/2) needs to be removed in order to split into two disconnected halves.
  • 8. 2D MESHTOPOLOGY  Nodes are arranged in a (usually square) grid  Each node has most four neighbors i.e. deg(M4,4)=√n=4  Longest distance between P0,0 and P3,3 Leading to diameter of 6 i.e. Daim(Mk,k)=2(√n-1)=6.  Removing all links between second and third row/column disconnects M4,4 into equal halves.Thus bisection width is bw(Mk,k)=(√n =4)
  • 9. 2D TORUSTOPOLOGY  A frequently used extension of mesh is torus  2D Torus Tk,k is extends Mk,k by adding wrap-around edges to directly connect left and right node of each raw as well the bottom and top node of each column.  Each node has most four neighbors i.e. deg(M4,4)=4  Longest distance between P0,0 and P3,3 Leading to diameter of 6 i.e. Daim(Mk,k)=(√n-1)=3.  Removing all links between second and third row/column disconnects M4,4 into equal halves.Thus bisection width is bw(Mk,k)=(2√n = 8)
  • 10. 3D MESHTOPOLOGY  Nodes are arranged in a (usually square) grid  Each node has most six neighbors i.e. degree is Deg(Mk,k,k)=6  Longest distance between P0,0 and P3,3 Leading to diameter of 6 i.e. Daim(Mk,k,k)=3(3√n-1).  Bisection width can be calculated as BW(Mk,k)=( n2/3)
  • 11. 3D MESHTOPOLOGY  3D Mesh topology has many desirable features such as a constant degree, relatively low diameter, and relatively high bisection width.  Thus it has been used as an interconnection network in top supercomputers
  • 12. 3D TORUSTOPOLOGY  Nodes are arranged in a (usually square) grid  Similar to 3d-Mesh topology just by adding wrap-around edges
  • 13. BINARY TREE TOPOLOGY  In order to reduce network diameter, a tree based structure can be used.  Each node is connected to its parent and two Childs hence degree is deg(BTd)=3  The longest distance is when travelling between left most node to right most half of tree, which requires growing up to the root and then down again so Diam(BTd) = 2(d-1) = 2log2 (n+1).  In-spite of constant degree and diameter is low disadvantage of binary tree is its bisection width.
  • 14. BINARY TREE TOPOLOGY  Removing only a single link with the root, we can split the network into two disconnected components i.e. bitwise width bw(BTd)=1
  • 15. HYPERCUBE NETWORK TOPOLOGY  Hypercube network can be represented as a graph with n=2d nodes that has each vertex labeled with a distinct bit of length d  Vertices that are connected iff bits string differ in exactly one bit.
  • 17. HYPERCUBE NETWORK TOPOLOGY  Each node is connected to d other nodes so degree will deg(Qd)=d=log2(n)  Longest distance between two nodes diam(Qd)=d=log2(n)  Removing all links between nodes starting with label O and all nodes starting with 1 disconnects Hd into two halves i.e. it holds bw(Qd)=n/2
  • 19. HYPERCUBE NETWORK TOPOLOGY  Overall hypercube has the highest bisection width  Furthermore diameter is very low (logarithmic)  But disadvantage is non constant degree. i.e. number of required links per node is logarithmic  Making it difficult to scale up to large number of nodes.