Explain loop level of parallel processing, Computer Engineering

Assignment Help:

Loop Level

At this stage, following loop iterations are candidates for parallel execution. Though, data dependencies among subsequent iterations can restrict parallel execution of instructions at loop level. There is vast scope for parallel execution at loop level. 

Illustration: In the subsequent 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) may be implemented by different processing elements provided there are at least n processing elements. Though, the instructions in the loop

 

                        For (J=0; J<= n; J++)

                        A (J) = A (J-1) + B (J)  

Cannot be executed parallely as A (J) is data dependent on A (J-1).  It implies that before using the loop level parallelism the data dependencies should be checked.

 


Related Discussions:- Explain loop level of parallel processing

Explain the difference between fixed and standard effect, Question: (a)...

Question: (a) There are several camera angles that can be used to make a sequence more interesting for a video production project. Explain clearly, using diagrams where appro

Illustration what is the cause of brownian motion, Q. Illustration what is ...

Q. Illustration what is the cause of Brownian motion? Answer:- Molecules in a gas move freely, randomly, constantly in all directions and at high speeds. They are capable

Explain about multidimensional features present in olap, Multidimensional s...

Multidimensional support is very necessary if we are to contain multiple hierarchies in our data analysis. Multidimensional feature permits a user to examine business and organizat

Define a register, Define a register. Ans:  Register:   A register...

Define a register. Ans:  Register:   A register contain a group of flip-flops and gates which effect their transition. The flip flops hold the binary information and the g

Implement that function using only nand gates, Q. Find simplified function ...

Q. Find simplified function F and implement that function using only NAND gates. 1.  F(A,B,C) = (A+B) (A'+B+C') (A'+B'+C') 2.  F (A,B,C,D) = A'B'C'+B'CD'+A'BCD'+AB'C' 3.

Explain dial tone and ringing tone in strowger telephony, Explain Dial Tone...

Explain Dial Tone and Ringing Tone in strowger telephony. Dial Tone: it is used to indicate that the exchange is ready to recognize dialed digits by the subscriber. The subsc

What are the digital certificates of hardware computations, What are the Di...

What are the Digital certificates of hardware computations Digital certificates are highly dependent on hardware computations, it is essential that mechanisms are evolved to i

What are base tables of an aggregate object, What are base tables of an agg...

What are base tables of an aggregate object? The tables making up an aggregate object (primary and secondary) are known as aggregate object.

Programs, A palindrome is a string that reads the same from both the ends. ...

A palindrome is a string that reads the same from both the ends. Given a string S convert it to a palindrome by doing character replacement. Your task is to convert S to palindrome

Backpropagation, Backpropagation: However Backpropagation can be seen ...

Backpropagation: However Backpropagation can be seen as utilising searching a space of network configurations as weights in order to find a configuration with the least error,

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