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

Features of mpi-1, Features of MPI-1 Binding for FORTRAN and C ...

Features of MPI-1 Binding for FORTRAN and C Collective communication Communication domains and Process groups Point-to-point communication Virtual process

Classify scheduler, Classify Scheduler. Scheduler is a kernel function ...

Classify Scheduler. Scheduler is a kernel function decide which method  be  thought to be implemented by the processor: the scheduler scans the list of processes in the ready s

What are the different types of distributing frames, What are the different...

What are the different types of distributing frames used in exchanges? The various distribution frames used in exchange are demonstrated in figure. Every subscriber in a telep

Task and parallel task, Task A logically discrete sector of a computati...

Task A logically discrete sector of a computational effort. A task is naturally a program or program-like set of instructions that is implemented by a processor.  Parallel

Approach to reasoning - first-order logic, Approach to reasoning - first-or...

Approach to reasoning - first-order logic: The formal approach to reasoning has bigger return and disadvantages. In generally we notice, if a computer program has proved somet

Describe the size and speed of scanners, Q. Describe the Size and Speed of ...

Q. Describe the Size and Speed of Scanners? Before actual scanning, a quick, low resolution scan known as pre-scan is made to preview the image and select scanning area. After

Boolean algebra, Boolean algebra. Boolean algebra mathematical method ...

Boolean algebra. Boolean algebra mathematical method based on human reasoning. In Boolean algebra only two states exist; true and false which are written as 1 (true) and 0 (fa

Write about TSR, Write about TSR TPA also holds TSR (terminate and stay...

Write about TSR TPA also holds TSR (terminate and stay resident) programs which remain in memory in an active state until activated by a hot-key sequence or another event like

What is instruction cycle, What is Instruction Cycle A program residing...

What is Instruction Cycle A program residing in the memory unit of the computer having of a sequence of instructions.  The program is implemented in the computer by going throu

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