Static and dynamic interconnection network, Computer Engineering

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.

 

Posted Date: 3/2/2013 4:41:20 AM | Location : United States







Related Discussions:- Static and dynamic interconnection network, Assignment Help, Ask Question on Static and dynamic interconnection network, Get Answer, Expert's Help, Static and dynamic interconnection network Discussions

Write discussion on Static and dynamic interconnection network
Your posts are moderated
Related Questions
What is a Multiplexer Tree? Ans Multiplexer Tree: The largest available MUX IC is 16 to 1. Meeting the larger input requires there must be a provision to expand this. It

Under what conditions can one pointer variable be subtracted from another? Pointer subtraction isn't used very much, but can be handy to determine the distances between two arr

A global variable is a variable A global variable is declared outside the body of each function.

Classification Of Parallel Computers  Introduction Parallel computers are those that underline the parallel processing among the operations in some way. In the last unit,


Describe about the Forms- DBMS Forms are generally known as data entry screens as they are user interface that allows data in the tables to be viewed, edited or entered. Forms

Define a B tree of order m. B Tree of order m  A balanced multiway search tree of order m in which every non root node having at least m/2 keys is known as a B-Tree of order

General Considerations for Research -artificial intelligence: If we can specify the initial state, the operators or a consumer and the goal check for a search problem, that al

explain associative mapping

Basic Concept of Data Parallelism Thinking the condition where the same problem of submission of „electricity bill? is Handled as follows: Again, three are counters. Howeve