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

Advantages to companies adopting call centres, Advantages to companies adop...

Advantages to companies adopting call centres Computer systems have allowed companies to set up call centres in other nations where potential cost savings can be made. This, of

Explain three-way handshake mechanism, Explain Three-Way Handshake Mechanis...

Explain Three-Way Handshake Mechanism used by TCP to terminate a Session reliably. Just to guarantee that connection is sets up or terminated reliably, transfer control protoco

Define exception, Define exception. The term exception is used to trans...

Define exception. The term exception is used to transfer to any event that causes an interruption

Explain about end-user computing, End-user Computing: The growing base of p...

End-user Computing: The growing base of personal computers and local area networks in the end user community are supported. This offers installation services, training and helps de

Minimization of the logic function using k-maps, Minimize the logic functio...

Minimize the logic function F(A, B, C, D) = ∑ m(1,3,5,8,9,11,15) + d(2,13) using K-maps Ans. The logic function minimization of F(A, B, C, D) = ∑ m(1,3,5,8,9,11.15) + d(2,13) by

#project, how to build PVR set-top box using raspberry

how to build PVR set-top box using raspberry

Programs portable on unix, How do you make programs portable on Unix and Do...

How do you make programs portable on Unix and Does under such circumstances? Constructors are invoked themself when the object is created for a class. There may be any number o

Explain the concept of switching, Question: (a) A computer network can...

Question: (a) A computer network can be a LAN or a WAN. Using appropriate diagrams and examples, explain what you understand by the term LAN. Your answer should also explain

How do you classify the neutrons, Q. How do you classify the neutrons in te...

Q. How do you classify the neutrons in terms of its kinetic energy? Neutrons are classified as-per to their kinetic energy as (a) Slow neutrons as well as (b) fast neutrons.

Discuss the 5-level switching hierarchy recommended by ccitt, Discuss the 5...

Discuss the 5-level switching hierarchy recommended by CCITT. Hierarchical networks are able of handling heavy traffic where needed, and at similar time use minimal number of t

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