Different models of computation-parallel algorithms, Computer Networking

Assignment Help:

There are various computational models for representing the parallel computers. In this part, we discuss various models. These models would give a platform for the designing as well as the analysis of the parallel algorithms.

Combinational Circuits

Combinational Circuit is one of the forms for parallel computers. In interconnection networks, many processors communicate with each other directly and do not need a shared memory in between. Mostly, combinational circuit (cc) is a connected arrangement of logic gates with a set of m input lines and a set of n output lines as given in Figure. The combinational circuits are mostly made up of various interconnected components arranged in the form called as stages as given in Figure.

587_Combinational circuit.png

                                                                          Combinational circuit

2413_Detailed combinational circuit.png

Detailed combinational circuit

It might be noted here that there is no feedback control employed in combinational circuits. There are a small number of terminologies followed in the context of combinational circuits such as fan in and fan out. Fan in indicates the number of input lines attached to each device and fan out indicates the number of output lines. In Figure , the fan in is 3 and fan out is also 3. The following parameters are used for analyzing a combinational circuit:

1)  Depth: It means that the total number of phases used in the combinational circuit starting from the input lines to the output lines. For example, in the depth are 4, as there are four different phases attached to a interconnection network. The other form of interpretation of depth can be that it represents the worst case time complexity of resolving a problem as input is given at the initial input lines and data is transmitted between various phases through the interconnection network and at the end reaches the output lines.

2) Width: It represents the total number of devices attached for a particular phase. For example in Figure, there are 4 components linked to the interconnection network. It means that the width is 4.

3)  Size: It represents the total count of devices used in the complete combinational circuit. For example, in Figure , the size of combinational circuit is 16 i.e. (width * depth).


Related Discussions:- Different models of computation-parallel algorithms

What are the fundamentals of intranet, Fundamentals of intranet Introd...

Fundamentals of intranet Introduction The history of the Intranet starts right from the days when computer networks came in. However, it could find a name and place for it

Fat tree, Fat tree It is a modified version of the tree network. In thi...

Fat tree It is a modified version of the tree network. In this group the bandwidth of edge (or the connecting wire among nodes) increases towards the root. It is a more practic

Analysis of parallel algorithms, A generic algorithm is mostly analyzed on ...

A generic algorithm is mostly analyzed on the basis of the following parameters: the time complexity (implementation time) and the space complexity (amount of space necessary). Usu

What are the two broad classes of middleware, Two broad classes of middlewa...

Two broad classes of middleware are a) General middleware b) Service-specific middleware.

How to configure vtp pruning on the switches-ccna, Configure VTP Pruning on...

Configure VTP Pruning on the Switches VTP pruning permits a VTP server to suppress IP broadcast traffic for particular VLANs to switches that do not have any ports in that VLAN

Firewall architectures-screened host architecture, Screened Host Architectu...

Screened Host Architecture This architecture consists of two host machines: a Screening Router and a Screening Host. Screening Router is placed between a local network and the

What do you mean by flow control, Q. What do you mean by Flow Control? ...

Q. What do you mean by Flow Control? - How much data sender is capable to transmit before receiving the ACK - Why flow control? - Limitation with receiver 1. Processin

Computing shortest path in a graph, While calculating shortest path, first ...

While calculating shortest path, first we assume graph presentation of network at every node then we use Djikstra's algorithm to calculate shortest path from every node to other on

Explain collision, When the signal hits to each other, collision accord.

When the signal hits to each other, collision accord.

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