Efficiency of vector processing over scalar processing, Computer Engineering

Assignment Help:

Efficiency of Vector Processing over Scalar Processing:

We know that, a sequential computer processes scalar operands one at a time. Thus, if we have to process a vector of length n through the sequential computer then the vector have to be broken into n scalar steps and implemented one by one.

For example, take the following vector addition:

A + B → C

The vectors are of length 500. This operation through the sequential computer can be specified by 500 add instructions as given below:

C[1] = A[1] + B[1]

 C[2] = A[2] + B[2]

....................................

C[500] = A[500] + B[500]

If we execute the similar operation through a pipelined-vector computer then it does not split the vectors in 500 add statements. Because a vector processor having the set of vector instructions that allow the operations to be specified in one vector instruction as:

A (1:500) + B (1:500) → C (1:500)

Every vector operation may be split internally in scalar operations but they are implemented in parallel which results in mush quicker implementation as compared to sequential computer.

Therefore, the benefit of adopting vector processing over scalar processing is that it eliminates the overhead cause by the loop control need in a sequential computer.


Related Discussions:- Efficiency of vector processing over scalar processing

Propositional logic, Propositional Logic: This is a fairly restrictive...

Propositional Logic: This is a fairly restrictive logic, that allows us to be write sentences about ¬propositions - statements about the world - that can either be true or

Implement and - or- not gates using bit wise operator, Q. Develop  a menu d...

Q. Develop  a menu driven program to implement AND, OR, NOT gates using and without using  Bit wise operator. The menu  should  be  as follows: I.  Using Bit Wise operator I

Real life decoding, We have not considered the time element in our decoding...

We have not considered the time element in our decoding. An important time for decoding is the time from the address strobe (AS) to when the data is required in a read.   Time

And-introduction rule, And-Introduction: In generally English says tha...

And-Introduction: In generally English says that "if we know that a lot of things are true, so we know that the conjunction of all of them is true", then we can introduce conj

Graphic symbol of S-R flip-flop, Q. Graphic symbol of S-R flip-flop? R...

Q. Graphic symbol of S-R flip-flop? R-S Flip flop - Graphic symbol of S-R flip-flop is displayed in Fig below. It has 3 inputs S (set), R (reset) and C (for clock). Q(t+1) is

Node at the highest level in the structure, Node at the highest level in th...

Node at the highest level in the structure is known as?? Root.

How to create dlq rules table, DLQ - Dead Letter Queue If an applicati...

DLQ - Dead Letter Queue If an application tries to put a message to one more application and if it is not delivered then it goes to the DLQ. So DLQ is not anything but all und

Determine the o/p when i/p A=11001 is applied to a NOT gate, When an input ...

When an input signal A=11001 is applied to a NOT gate serially, its output signal is ? Ans. First input applied will be LSB 00110, as A=11001 is serially applied to a NOT gate

Manipulate the presentation and attributes interactive list, How can you m...

How can you manipulate the presentation and attributes of interactive lists? ---Scrolling by Interactive Lists. ---Setting the Cursor from within the Program. ---Changing

Explain procedure level of parallel processing, Procedure Level Here, p...

Procedure Level Here, parallelism is obtainable in the form of parallel executable procedures. In that case, design of algorithm plays a key role. E.g. every thread in Java is

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