Efficiency of vector processing over scalar processing, Computer Engineering

Assignment Help:

Efficiency of Vector Processing over Scalar Processing

As we know a serial computer processes single scalar operands at a time. So if we have to process a vector of length 'n' by the sequential computer then vector should be divided into n scalar steps and implemented one by one.

E.g. think about the following vector addition:

    A + B → C

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

969_Efficiency of Vector Processing over Scalar Processing.png

If we execute the same operation by a pipelined vector computer then it doesn't break the vectors in 500 add statements. Since a vector processor has the set of vector instructions which allow the operations to be specified in one vector instruction like:

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

Each vector operation can be broken internally in scalar operations however they are executed concurrently which yields in much faster execution as compared to serial computer. So the benefit of using vector processing over scalar processing is it eliminates the overhead caused by the loop control needed in a serial computer.


Related Discussions:- Efficiency of vector processing over scalar processing

What is a call request signal, Call request signal is: (A)  Seize sig...

Call request signal is: (A)  Seize signal (B) Idle state signal (C)  Line identification signal (D) Called subscriber alert signal      Ans: Call request

Iterative deepening search, Iterative Deepening Search: So, breadth fi...

Iterative Deepening Search: So, breadth first search is always guaranteed to find a solution (if one exists), actually it eats all the memory. For the depth first search, ther

What are the layers of data description in r/3, What are the layers of data...

What are the layers of data description in R/3? There layesr are there:- The external layer. The ABAP/4 layer. The database layer.

Explain about double error detection bit, Q. Explain about Double Error Det...

Q. Explain about Double Error Detection bit? Let's presume now that two bit errors take place in data. Data received: So on -matching we conclude P3-D3 pair doesn't

Example on hamming error correcting code, Q. Example on hamming error corre...

Q. Example on hamming error correcting code? For illustration a 4-bit matching word can stand for 2 4 =16 values that range from 0 to 15 as: 0000, 0001, 0010, 0011, 0100, 01

#MyLife, where should I work?

where should I work?

Explain about quine mckluskey method, Q. Explain about Quine McKluskey Meth...

Q. Explain about Quine McKluskey Method? A tabular method was proposed to deal with increasing number of variables called Quine McKluskey Method. This method is appropriate for

What is SSTF, SSTF stands for ? Ans. Shortest-Seek-time-first scheduli...

SSTF stands for ? Ans. Shortest-Seek-time-first scheduling.

Perfect induction, Any identity or equality in Boolean algebra, suchas de M...

Any identity or equality in Boolean algebra, suchas de Morgan's Theorem can be proved usingthe method of perfect induction. 1. All combinations of variables are written down.

Balanced trees and their operations, what is ment by avl tree n insertion n...

what is ment by avl tree n insertion n deletion ,2-3 tress insertion n deletion

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