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

How is an intranet different from an internet, QUESTION a) How is an In...

QUESTION a) How is an Intranet different from an Internet? b) State the main differences between a router and a switch c) Explain the function of a modem d) Calculate

What is netbios and netbeui in networking, What is NETBIOS and NETBEUI in N...

What is NETBIOS and NETBEUI in Networking? NETBIOS is a programming interface that permits I/O requests to be sent to and received from a remote computer and it keeps the netwo

What is clipper, Clipper is a compiler that was well recognized at the time...

Clipper is a compiler that was well recognized at the time of80's and early times of 90's. We can build DOS based applications (even large applications too) using clipper. There is

Different kinds of host in multicasting, What are the different kinds of ho...

What are the different kinds of host in multicasting?

Computes their distance vector for network, Consider the following network ...

Consider the following network example. Suppose that the distance vector (DV) routing algorithm is used to compute the distance between nodes. (a) Show the procedure of nod

Explain torus interconnection networks, Torus: The mesh network with wrap ...

Torus: The mesh network with wrap around connections is termed as Tours Network. Figure: Torus network

Explain the transport layer and network layer, Question: (a) Describe ...

Question: (a) Describe briefly the difference between flow control and congestion control in relation to a connection-oriented protocol such as TCP. (b) What is the initia

Urgent pointer - transport layer, Urgent Pointer This 16 bite whic...

Urgent Pointer This 16 bite which is valid  only f the urgent  flag is set is used  when the segment  contains  urgent data. If  defines  the number  that must be  added  t

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

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