Loop level-levels of parallel processing, Computer Engineering

Assignment Help:

Loop Level

At this level, repeated loop iterations are the applicants for parallel execution. However, data dependencies among subsequent iterations may limit parallel execution of instructions at loop level. There is a lot of scale for parallel execution at loop level.

Ex: In the following loop in C language, for (i=0; i <= n; i++)

A(i) = B(i)+ C(i)

Each of the instruction A(i) =B(i)+C(i) can be implemented by different processing elements supplied  there are at least n processing elements. But, the instructions in the loop:

for ( J=0, J<= n, J++) A(J) = A(J-1) + B(J)

Cannot be implemented parallel as A(J) is data dependent on A(J-1).  This means that previous to exploiting the loop level parallelism the data dependencies have to be checked:

 


Related Discussions:- Loop level-levels of parallel processing

Why the tcp checksum is necessary, Is the TCP checksum necessary? Yes, ...

Is the TCP checksum necessary? Yes, TCP Checksum is essential. TCP layer is liable for error detection, transmission of packets if needed, error control, reassembly of packe

How can arithmetic processor be associated to the CPU, Q. How can this arit...

Q. How can this arithmetic processor be associated to the CPU?  Two mechanisms are used for connecting arithmetic processor to CPU.   If an arithmetic processor is treated a

Translate assembly language program to machine , A useful exercise in under...

A useful exercise in understanding assembly language and its relation to machine language is to take a short assembly language program and translate it to machine language by hand.

Asp.net, how work for asp.net

how work for asp.net

Explain the use of functions in parallel programming, Q. Explain the Use of...

Q. Explain the Use of functions in parallel programming? include "pvm3.h" main() {    int cc, tid, msgtag;    char buf[100];    printf("%x\n", pvm_mytid());

State the optimal route of node, State the optimal route of node Consid...

State the optimal route of node Consider the node i which has path length K+1, with the directly preceding node on the path being j. The distance to node i is w(j, i) plus the

C++ programming, how does a ohms law c++ programming works

how does a ohms law c++ programming works

Commutativity of connectives, Commutativity of Connectives : In this y...

Commutativity of Connectives : In this you will be aware of the fact that some arithmetic operators that have a property which it doesn't matter that way around you give the o

Differentiate between intranet and internet, Differentiate between intranet...

Differentiate between intranet and internet Some comparisons between intranet and internet include: -  INTERNET is INTERnational NETwork -  An INTRANET is INTernal Restri

Define hyperlinks, Q. Define Hyperlinks? Hyperlinks, or links are one o...

Q. Define Hyperlinks? Hyperlinks, or links are one of the most significant characteristics of web pages. A link moves us from current page to a destination which is specified i

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