×
Create CV Books Summaries Online Courses Blog Communities

Login

Sign up
MindLuster Logo
Categories
Recent

Interconnection Network Design

Track :

Computer Science

Lessons no : 38

For Free Certificate After Complete The Course

To Register in Course you have to watch at least 30 Second of any lesson

Join The Course Go To Community Download Course Content

What will you learn in this course?
  • Design scalable interconnection networks for high-performance computer systems and data centers using modern topology principles
  • Optimize data flow and reduce latency in interconnection networks through effective routing and switching techniques
  • Evaluate different interconnection network architectures to select the best fit for specific computing and data center needs
  • Implement fault-tolerant strategies to enhance reliability and resilience of interconnection networks
  • Analyze network performance metrics to identify bottlenecks and improve overall system efficiency
  • Apply principles of network topology, bandwidth management, and congestion control in real-world scenarios
  • Utilize simulation tools to model and test interconnection network designs for optimal performance
  • Integrate energy-efficient practices into the design and operation of interconnection networks for sustainable computing
  • Troubleshoot common issues in interconnection networks to ensure minimal downtime and high availability
  • Develop strategies for scaling interconnection networks to accommodate growing data and processing demands
  • Compare wired and wireless interconnection solutions for diverse computing environments
  • Implement security measures to protect data integrity and prevent unauthorized access in interconnection networks

How to Get The Certificate

  • You must have an account Register
  • Watch All Lessons
  • Watch at least 50% of Lesson Duration
  • you can follow your course progress From Your Profile
  • You can Register With Any Course For Free
  • The Certificate is free !
Lessons | 38
Parallel Algorithms Intro video
00:07:27

Parallel Algorithms Intro video
Lec 1 Shared Memory Models 1
00:50:08

Lec 1 Shared Memory Models 1
Lec 2 Shared Memory Models 2
00:47:43

Lec 2 Shared Memory Models 2
Lec 3 Interconnection Networks
00:54:23

Lec 3 Interconnection Networks
Lec 4 Cost and Optimality
00:49:42

Lec 4 Cost and Optimality
Lec 5 Basic Techniques 1
00:42:23

Lec 5 Basic Techniques 1
Lec 6 Basic Techniques 2
00:46:27

Lec 6 Basic Techniques 2
Lec 7 Basic Techniques 3
00:46:32

Lec 7 Basic Techniques 3
Lec 8 Basic Techniques 4
01:03:58

Lec 8 Basic Techniques 4
Lec 9 Basic Techniques 5
00:53:54

Lec 9 Basic Techniques 5
Lec 10 Odd Even Merge Sort OEMS
00:52:27

Lec 10 Odd Even Merge Sort OEMS
Lec 11 OEMS Bitonic Sort Merge Sort BSMS
00:57:31

Lec 11 OEMS Bitonic Sort Merge Sort BSMS
Lec 12 BSMS Optimal List Colouring
00:45:53

Lec 12 BSMS Optimal List Colouring
Lec 13 Description
00:55:43

Lec 13 Description
Lec 14 Analysis
00:57:08

Lec 14 Analysis
Lec 15 Applications
00:57:08

Lec 15 Applications
Lec 16 Applications
00:49:37

Lec 16 Applications
Lec 17 Fast optimal merge algorithm
00:50:05

Lec 17 Fast optimal merge algorithm
Lec 18 High level Description
00:54:04

Lec 18 High level Description
Lec19 Cole s Merge Sort Details
00:56:57

Lec19 Cole s Merge Sort Details
Lec20 Analysis of Cole s Merge Sort Lower bound for sorting
00:55:04

Lec20 Analysis of Cole s Merge Sort Lower bound for sorting
Lec21 Sorting Lower bound Connected Components
00:58:42

Lec21 Sorting Lower bound Connected Components
Lec 22 Connected Components CREW
00:54:18

Lec 22 Connected Components CREW
Lec 23 Connected Components Vertex Colouring
00:47:56

Lec 23 Connected Components Vertex Colouring
Lec 24 Sorting on a 2D mesh
00:59:51

Lec 24 Sorting on a 2D mesh
Lec 25 Sorting on a 2D mesh
00:47:21

Lec 25 Sorting on a 2D mesh
Lec 26 Sorting Offline routing on a 2D mesh
00:51:11

Lec 26 Sorting Offline routing on a 2D mesh
Lec 27 Sorting on a 3D mesh
00:50:23

Lec 27 Sorting on a 3D mesh
Lec 28 Mesh of Trees Hypercube
00:54:58

Lec 28 Mesh of Trees Hypercube
Lec 29 Hypercube cont d
00:42:36

Lec 29 Hypercube cont d
Lec 30 Hypercube cont d butterfly network
00:51:49

Lec 30 Hypercube cont d butterfly network
Lec 31 Butterfly CCC and Benes Networks
00:51:11

Lec 31 Butterfly CCC and Benes Networks
Lec 32 Butterfly CCC and Benes Networks
00:34:36

Lec 32 Butterfly CCC and Benes Networks
Lec 33 Shuffle Exchange Graphs de Bruijn Graphs
00:30:02

Lec 33 Shuffle Exchange Graphs de Bruijn Graphs
Lec 34 SEG dBG cont d
00:35:27

Lec 34 SEG dBG cont d
Lec 35 Circuit Value Problem is P complete for NC reductions
00:35:08

Lec 35 Circuit Value Problem is P complete for NC reductions
Lec 36 Ordered DFS is P complete for NC reductions
00:35:00

Lec 36 Ordered DFS is P complete for NC reductions
Lec 37 Max Flow is P complete for NC reductions
00:31:21

Lec 37 Max Flow is P complete for NC reductions


We Appreciate Your Feedback

Be the First One Review This Course

Excellent
0 Reviews
Good
0 Reviews
medium
0 Reviews
Acceptable
0 Reviews
Not Good
0 Reviews
0
0 Reviews

Our New Certified Courses Will Reach You in Our Telegram Channel
Join Our Telegram Channels to Get Best Free Courses

Join Now

Related Courses

Linear Algebra for Computer Scientists
7 Lessons

Linear Algebra for Computer Scientists

Insertion Sort
3 Lessons

Insertion Sort

Bubble Sort
4 Lessons

Bubble Sort

GCSE Computer Science
18 Lessons

GCSE Computer Science

Random Access Memory
7 Lessons

Random Access Memory

Binary Trees
4 Lessons

Binary Trees

Bitwise Operators
4 Lessons

Bitwise Operators

Introduction to Stacks Data Structures
17 Lessons

Introduction to Stacks Data Structures

Organization Theory Structure and Design
41 Lessons

Organization Theory Structure and Design

Handling Large Scale Unit Level Data
41 Lessons

Handling Large Scale Unit Level Data

Introduction to Machine Learning
19 Lessons

Introduction to Machine Learning

Applied Linear Algebra Vectors Matrices
54 Lessons

Applied Linear Algebra Vectors Matrices

Artificial Intelligence beginners
1 Lessons

Artificial Intelligence beginners

Machine Learning Autumn 2018
1 Lessons

Machine Learning Autumn 2018

Robotics and Autonomous Systems
15 Lessons

Robotics and Autonomous Systems

Natural Language Understanding
15 Lessons

Natural Language Understanding

Interconnection Network course in hindi, in this course we will learn about the design, operation, and optimization of interconnection networks in computer systems and data centers.