Sorting using interconnection networks, Computer Engineering

Assignment Help:

The combinational circuits employ the comparators for comparing the numbers and storing them on the basis of maximum and minimum functions. Likewise in the interconnection networks the two processors carry out the computation of maximum and minimum functions in the given way below: 

Let's consider that there are 2 processors pi and pj. Every one of these processors has been given as input an element of sequence say ei and ej. Now the processor pi transmits the element ei to pj and subsequently processor pj sends ej to pi. Afterwards processor pi computes the minimum of ei and ej it implies that min (ei,ej) and processor pj computes the maximum of ei and ej, it implies that max (ei,ej). The above process is known as compare-exchange and it has been depicted in Figure.

822_SORTING USING INTERCONNECTION NETWORKS.png

Figure: Illustration of Exchange-cum-Comparison in interconnection networks


Related Discussions:- Sorting using interconnection networks

Draw logic circuit for the simplified function, Minimize the logic function...

Minimize the logic function Y(A, B, C, D) = ∑m(0,1,2,3,5,7,8,9,11,14). Use  Karnaugh map. Draw logic circuit for the simplified function. Ans: In following figure (a) shows the

Discuss the mount and unmount system calls, Discuss the mount and unmount s...

Discuss the mount and unmount system calls. The privileged mount system call is used to join a file system to a directory of another file system; the unmount system call detach

Prepurchase and purchase consummation of consumer mercantile, Differentiate...

Differentiate between Prepurchase and Purchase Consummation of consumer mercantile model. The prepurchase interaction for consumers comprises three activities: Product/ser

Spatial domain interpolation, Transfer Domain Create an interpolation al...

Transfer Domain Create an interpolation algorithm using the fast Fourier transformer. Assess the performance of the algorithm by using the PSNR and SSIM.  Compare your results w

Existential introduction, Existential Introduction: Now if we have any...

Existential Introduction: Now if we have any sentence as, A, and variable, v, that does not occur in A, so then for any ground term, g, such occurs in A, than we can turn A in

Explain the different types of buses with neat diagram, Explain the differe...

Explain the different types of buses with neat diagram. When a word of data is transferred among units, all the bits are transferred in parallel over a set of lines known as bu

Which scheduling is suitable for time-shared operatin system, Which schedul...

Which scheduling policy is most suitable for a time-shared operating system? Ans. Round-Robin scheduling policy is most appropriate for a time-shared operating system.

Why we need linker, Q. Why we need linker?  The linker: Joins as...

Q. Why we need linker?  The linker: Joins assembled module in one executable program, Produces an .EXE module and initializes with special instructions to facilitate

Processing elements (pes) -array processing, Processing elements (PEs)  : E...

Processing elements (PEs)  : Every processing element consists of ALU, local memory and its registers  for storage of distributed data. This PEs has been interconnected via an inte

Payment, how can get payment

how can get payment

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