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

Link your documents to site, Images in the top area of Compass home page gu...

Images in the top area of Compass home page guide visitors to specific pages on the site. Now you will add links for navigation buttons. You will see that there are some ways to

Explain flash devices, Explain Flash devices It is possible to read the...

Explain Flash devices It is possible to read the contents of a one cell, but it is only possible to write an whole block of cells Greater density which leads to superior cap

Determine the framed data including a parity bit, Determine the Framed data...

Determine the Framed data including a parity bit   For illustration when even parity is chosen, parity bit is transmitted with a value of 0 if the number of preceding

Design requirements of sequential circuit, What are the Requirements to des...

What are the Requirements to design Sequential circuit Ans . Design Requirements of Sequential circuit: (i) The circuit specifications translated into a state diagram

Find the boolean expression for boolean algebra, Find the Boolean expressio...

Find the Boolean expression for logic circuit shown in Figure below and reduce it using Boolean algebra. Ans. Y = (AB)' + (A' + B)' = A' + B' + AB' by using Demorgan's Theorem. =

Networking, how to connect a home network

how to connect a home network

Differentiate between exception and validation testing, Differentiate betwe...

Differentiate between exception and validation testing. - Validation testing is done to test the software in conformance to the needs specified. It aims to demonstrate that the

Essential features of an algorithm, Necessary features of an algorithm: ...

Necessary features of an algorithm: 1.Input: The algorithm should take zero or more input. 2. Output: The algorithm should generate one or more outputs.  3. Definiteness:

Explain bootp (boot strap protocol), Explain BOOTP (Boot Strap Protocol). ...

Explain BOOTP (Boot Strap Protocol). TCP or IP designer observed that several of the configuration steps could be combined in a single step if a server was capable to supply mo

Define overflow, Define Overflow.  An overflow is a problem in digital ...

Define Overflow.  An overflow is a problem in digital computer due to the width of registers is finite. A result that contains n+ 1 bit cannot be accommodated in a register wit

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