Sorting using interconnection networks, Computer Networking

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

Posted Date: 3/2/2013 6:51:01 AM | Location : United States

Related Discussions:- Sorting using interconnection networks, Assignment Help, Ask Question on Sorting using interconnection networks, Get Answer, Expert's Help, Sorting using interconnection networks Discussions

Write discussion on Sorting using interconnection networks
Your posts are moderated
Related Questions
Describe the concept of internetwork and intranetwork routing protocols?

Normal 0 false false false EN-IN X-NONE X-NONE

How do you account for higher scalability and reliability of computer network? Ans: Computer network will have a large number of computers, which can share database, software

Explain Radio Wave. Although Radio waves are common and well understood, we are just starting to realize their enormous potential as a networking medium. Radio waves can operat

A typical layer 2 switch has a number of features. Identify and explain 5 features that you think are important that you would consider in your evaluation of L2 switches offered b

Mean node-node path The mean node-node path is two times the mean node-root path.  Number the levels of the tree with the root as 1 and the deepest level as N.  The path from t

Q. Example of go back - N protocol? The window size is 4. A sender has sent frame 6 as well as the timer expires for frame 3 (frame 3 not ACKn'd). The sender goes back as we