Blocking and non-blocking network, Computer Engineering

Blocking and Non-Blocking network

In non-blocking networks the route from any free input node to any free output node can always be offered. Crossbar is an best example of non-blocking network. In a blocking network instantaneous route establishment among a pair of nodes may not be possible. There may be condition where blocking can occur. Blocking refers to the condition where one switch is necessary to establish more than one connection concurrently and end-to-end path cannot be established even if the input nodes and output nodes are free. Example of this is a blocking multistage network.

 

Posted Date: 3/2/2013 4:40:26 AM | Location : United States







Related Discussions:- Blocking and non-blocking network, Assignment Help, Ask Question on Blocking and non-blocking network, Get Answer, Expert's Help, Blocking and non-blocking network Discussions

Write discussion on Blocking and non-blocking network
Your posts are moderated
Related Questions
What are the limitations of mobile devices? For mobile devices we require both PC-integrated applications and specialized mobile services quite than repurposed website content.

Explain the product lifecycle in an Operating System

Execution of a program in CPU is completed employing different set of registers and their individual circuitry. As CPU registers are used for execution of interrupt service routine

Which translator perform macro expansion, is called? Ans. Macro pre-processor perform macro expansion.

Q. Limitations of execution of instructions? 1. Size of memory shown in 16 words while instruction is capable of addressing 210 =1 K words of Memory. However why 210 since 10 b

Write a script that will first initialize a string variable that will kept x and y coordinates of a point in the form 'x 3.1 y 6.4'.  Then, use string manipulating functions to ext

Name the languages introduced in second  generation During  the time of  second  generation  many  high  level  programming  languages  were introduced, such as FORTRAN (1956),

Describe the necessary conditions for Deadlock. Required conditions for deadlock 1. Mutual exclusion 2. Hold and wait 3. No preemption 4. Circular wait Mutual e

Links and Association Links and associations are the basic means used for establishing relationships among objects and classes of the system. In the next subsection we will di

If we have multiple filters impleted, what is the order in which these filters get implemented?   Ans) 1. Authorization filters 2. Response filters 3. Action filters