Static and dynamic interconnection network, Computer Engineering

Assignment Help:

Static and Dynamic Interconnection Network

In a static network the connection among input and output nodes is permanent and cannot be changed. Static interconnection network cannot be restructured. The examples of this type of network are ring, linear array, tree, star, chordal ring, fat tree, mesh, systolic arrays, tours and hypercube. This type of interconnection networks are more consider for building computers where the communication pattern is extra or less fixed, and can be executed with static connections. In dynamic network the interconnection pattern among inputs and outputs can be changed. The interconnection pattern can be restructured according to the program demands.  Here, instead of fixed connections, the arbiters or switches are used. Examples of such networks are crossbar switches, buses and multistage networks.  The dynamic networks are normally used in shared memory(SM) multiprocessors.

 


Related Discussions:- Static and dynamic interconnection network

Lexical analyser, The aim of this project is for you to construct a fully w...

The aim of this project is for you to construct a fully working compiler for a small simple programming language, SPL. The compiler will read in SPL source code and produce ANSI C

Example of blocking probability for the three stage network, A three stage ...

A three stage network is realized by using switching matrices of size p x s in stage 1, r x r matrices in stage 2 and s x p matrices in stage 3. Using the Lee's probability graph s

What is scan, What is "Scan"? Scan Insertion and ATPG helps test ASICs ...

What is "Scan"? Scan Insertion and ATPG helps test ASICs (e.g. chips) during manufacture. If you know what JTAG boundary scan is, then Scan is the similar idea except that it i

Sort Wars, If quicksort is so quick, why bother with anything else? If bubb...

If quicksort is so quick, why bother with anything else? If bubble sort is so bad, why even mention it? For that matter, why are there so many sorting algorithms?

Draw the logic diagram of 4-bit odd parity checkers, Normal 0 f...

Normal 0 false false false EN-IN X-NONE X-NONE

Eme, state function and path function

state function and path function

Mpi, write an8086 alp to exchange a block of N bytes of data between sourc...

write an8086 alp to exchange a block of N bytes of data between source and destination

What is delayed branching, What is delayed branching? A method called d...

What is delayed branching? A method called delayed branching can minimize the penalty incurred as a result of conditional branch instructions. The idea is easy. The instruction

Hard disk architecture, Hard disk Architecture: A hard disk drive ...

Hard disk Architecture: A hard disk drive having the platters and motor hub removed indicating the copper colored stator coils surrounding a bearing at the cen

First in first out method, The First In First Out method assumes items of s...

The First In First Out method assumes items of stocks are issued in the same order as they are received. Thus the goods received first are assumed to be the first to be issued .Any

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd