Interconnection network in the form of a linear array, Computer Engineering

Assignment Help:

Q. Interconnection network in the form of a Linear Array?

The sorting problem particularly selected is bubble sort and interconnection network may be represented as n processors interconnected with one another in form of a linear array like displayed in Figure below. The method adopted for solving the bubble sort is called odd-even transposition. Suppose an input sequence is B= (b1, b2, b3, b4......... bn) and every number is assigned to a specific processor. In the odd-even transposition the sorting is done with the help of two stages known as odd phase and even phase. In the odd stage the elements stored in (p1, p2), (p3, p4), (p5, p6)......... (pn-1, pn) are compared according to Figure and consequently exchanged if needed it implies that if they are out of order. In 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 needed i.e. if they are out of order. Remember in the even phase the elements stored in p1 and pn aren't exchanged and compared. The total number of phases needed for sorting the numbers is n it implies that n/2 even phases and n/2 odd phases. The algorithmic demonstration of the above considered odd-even transposition is given below: 

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

Figure: Interconnection network in the form of a Linear Array


Related Discussions:- Interconnection network in the form of a linear array

Name some register output control signals, Name some register output contro...

Name some register output control signals. Pc out , MDR out , Z out , Offset out , R1 out , R2 out , R3 out and TEMP out .

Types of structure charts, Types of Structure Charts Transaction struc...

Types of Structure Charts Transaction structure - control module calls subordinate modules, each of which handles a certain transaction More afferent processes Le

Explain bit-o-ring technique, Explain bit-O-Ring technique. The micro p...

Explain bit-O-Ring technique. The micro program represents that branches are not always made to a one branch address. This is a direct consequence of combining easy micro routi

How many address bits are needed to show a 32 K memory, How many address bi...

How many address bits are required to represent a 32 K memory ? Ans. 32K = 25 x 210 = 215, Hence 15 address bits are needed; Only 16 bits can address this.

Explain difference between dynamic and static binding, Explain difference b...

Explain difference between Dynamic and static binding. Dynamic and static binding: Dynamic binding is a binding performed after the execution of a program has immediately beg

What is the use of object factories, Factory methods that will be used to m...

Factory methods that will be used to make objects just like in a static way.

Explain circuit switching versus packet switching, Explain difference of Ci...

Explain difference of Circuit switching versus Packet switching. Within circuit switching an end-to-end path is to be establishing before any data can be sent. Previously a con

Senior project, any ideas about senior project topic

any ideas about senior project topic

What are prefetch instructions, What are prefetch instructions? Prefetc...

What are prefetch instructions? Prefetch instructions are those instructions which can be inserted into a program either by the programmer or by the compiler.

Explain HLL program & execution of machine language program, Give the Schem...

Give the Schematic of Interpretation of HLL program and execution of a machine language program by the CPU. The CPU utilizes a program counter (PC) to notice the address of nex

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