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

Define the types of software life cycle, Define the types of software life ...

Define the types of software life cycle Any system progress refers to the initial part of the software life cycle: analysis, design, and implementation. During object oriented

Explain about registers, Q. Explain about Registers? A register is a gr...

Q. Explain about Registers? A register is a group of flip-flops that store binary information and gates that controls when and how information is transferred to register. An n-

Decomposition model of parallel programming, The PVM system supports functi...

The PVM system supports functional and data decomposition model of parallel programming. It attaches with C, C++, and FORTRAN. The C and C++ language bindings for the PVM user inte

Temporary registers w and z, Why the temporary registers W and Z are named ...

Why the temporary registers W and Z are named so I mean we start from A,B,C,D,E then H and L coz H stands for higher bit nd L for lower bit of the address pointed by memory pointer

Algorithm to have a good best case running time, How can we change almost a...

How can we change almost any algorithm to have a good best case running time? Check whether the input constitutes an input at the very starting Or else run the original algo

What are different edi components and edi services, What are different EDI ...

What are different EDI components and EDI services? Different EDI components and EDI services are illustrated as: Three main components including services in EDI System are

Which algorithm is used to solve computational problems, Which algorithm is...

Which algorithm is used to solve computational problems If we want to solve any problem then we use a series of well-defined steps. These steps are collectively known as algori

Determine about the intranet server, Determine about the Intranet server ...

Determine about the Intranet server The success or usage of the Intranet server is measured by the number of operations it handles per Unit time. The selection of a good server

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