Sorting using interconnection networks, Computer Networking

Assignment Help:

The combinational circuits use the comparators for comparing the storing and number them on the basis of minimum and maximum functions. Likewise, in the interconnection networks the two processors perform the computation of minimum and maximum functions in the following way:

Let us consider there are two processors pj and pi. Each of these processors has been given as input a part of the sequence, say ej and ei. Now, the processor pi sends the element ei to pj and processor pj sends ej to pi. After that, processor pi determine the minimum of ei and ej i.e., min (ei,ej) and processor pj determine the maximum of ei and ej, i.e. max (ei,ej). The above method is called as compare-exchange and it has been depicted in the Figure .

581_Illustration of Exchange-cum-Comparison in interconnection networks.png

                                                          Illustration of Exchange-cum-Comparison in interconnection networks

 The sorting problem chosen is bubble sort and the interconnection network can be depicted as n processors interconnected with each other in the type of a linear array as given in Figure. The method adopted for solving the bubble sort is called as odd- even transposition. Suppose an input series is B=(b1, b2, b3, b4......... bn) and each number is assigned to a particular processor. In the odd-even transposition,the sorting is executed with the help of two phases known as odd phase and even phase. In the odd phase, the elements stored in (p1, p2), (p3, p4), (p5, p6)......... (pn-1, pn) are compared according to the Figure and consequently exchanged if required i.e. if they are out of sort. In the even phase, the elements stored in (p2, p3), (p4, p5), (p6, p7)......... (pn-2, pn-1) are compared according to the Figure and consequently exchanged if required, i.e. if they are out of order. keep in mind, in the even phase the elements stored in p1 and pn are not exchanged and compared. The total number of phases needed for sorting the numbers is n i.e. n/2 odd phases and n/2 even phases. The algorithmic representation of the above discussed odd- even transposition is given below:

2084_Interconnection network in the form of a Linear Array.png

                                                Interconnection network in the form of a Linear Array


Related Discussions:- Sorting using interconnection networks

State in brief about the graceful degradation, State in brief about the Gra...

State in brief about the Graceful degradation With FDMA or TDMA, a fixed number of users can concurrently access the system. Though, with CDMA, as more user concurrently access

Router components - network layer and routing , Router Components As no...

Router Components As noted in the  previous  a router consists of a of input  interfaces at which  packets arrive and a set  of output interfaces from  which  packets depart. T

Identify three udp characteristics, UPD is a layer 4 Transport protocol. It...

UPD is a layer 4 Transport protocol. It is connection-less due to it does establish a connection thus the 3 step handshake is not needed, it does NOT execute any flow control or ac

How intranets encourage integration of applications, How Intranets encourag...

How Intranets encourage integration of applications Intranets encourage integration of applications; such as the simple word processing application could be easily linked with

Tree interconnection network, Tree interconnection network Tree inter...

Tree interconnection network Tree interconnection network(TIN)), processors are organized in a whole binary tree pattern.

Transport protocols - udp and tcp, Most real-life applications are built on...

Most real-life applications are built on top of the UDP and TCP transport protocols. UDP, which stands for User Datagram Protocol, provides the capability of delivering individual

Fixed version of rdt , Fixed version of rdt 2.0 rdt 2.1 The  rdt 2.1 s...

Fixed version of rdt 2.0 rdt 2.1 The  rdt 2.1 sender and receiver  FSM each now  have  twice  as many  states  as before. This is because  the protocols  state must  now refle

use dijkstras shortest-path algorithm compute short path, Consider the fol...

Consider the following network example. With the indicated link costs along each link in the figure, use Dijkstra's shortest-path algorithm to compute the shortest path from x to a

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