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

Illustrate the basic structure of the von neumann machine, Illustrate the b...

Illustrate the basic structure of the von Neumann machine The following figure shows basic structure of the von Neumann machine. A von Neumann machine has only a single path be

Ending transactions - data phase, Ending transactions: Either side may...

Ending transactions: Either side may request that a burst end after the present data phase. Simple PCI component that do not support multi-word bursts will always request this

Develop website for my party venue- hall rental website, Project Descriptio...

Project Description: I want to prepare website for my party venue where i can post the photos and detail of place along with availability calendar. In future, I buy some more ha

Algebraic method for simplification of boolean expressions, Define Algebrai...

Define Algebraic method for Simplification of the Boolean Expressions This method is depend on the by knowledge of the Boolean algebra. Expression can be making simpler by usin

Explain recursive descent parsing, Explain Recursive Descent Parsing It...

Explain Recursive Descent Parsing It is a top down parsing with no backtracking. This parsing method uses a set of recursive processes to perform parsing. Most important advant

Application using shift operations, Application Using Shift Operations ...

Application Using Shift Operations Rotate and Shift instructions are helpful even for division andmultiplication. These operations are not normally available in high-level lang

Define object oriented and structured development, How object oriented deve...

How object oriented development is dissimilar from structured development object oriented development is dissimilar from structured development of the system. In the structure

Difference among the static rams and dynamic ram, Difference among the Stat...

Difference among the Static rams and dynamic rams. Static RAM: It is costly as each bit of memory will take around 6 CMOS transistors. More speedy as transistors are us

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