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

Memory management unit, A computer system with 16K of memory, a Memory Mana...

A computer system with 16K of memory, a Memory Management Unit with a page size of 2000, and the following page translation table :      Logical Address    Physical Start 0000

Generation of erp products, 1. How does this new generation of ERP products...

1. How does this new generation of ERP products differ from traditional solutions? 2. What are the major external forces driving competition in the ERP industry? Cloud comput

Define about pascaline - mechanical computers, Pascaline:Mechanical compute...

Pascaline:Mechanical computers Blaise Pascal made the initial attempt in the direction of this automatic computing. He invented a apparatus, which comprised of lots of gears an

Plot2fnhand, Write a function "plot2fnhand" that will receive 2 function ha...

Write a function "plot2fnhand" that will receive 2 function handles as input arguments, and will show in two Figure Windows plots of these functions, with the function names in the

Explain busy waiting semaphores, Explain busy waiting semaphores. Weak,...

Explain busy waiting semaphores. Weak, Busy-wait Semaphores: The simplest method to implement semaphores. Useful while critical sections last for a short time, or we

Add the equation by using 648 and 487 in bcd code, Add 648 and 487 in BCD c...

Add 648 and 487 in BCD code. Ans. In BCD Code, addition of 648 and 487: 6 4 8  =  0 1 1 0   0 1 0 0      1 0 0 0 4 8 7  =  0 1 0 0   1 0 0 0      0 1 1 1 ---------------------

Control dependence, Control Dependence Segments or Instructions in a pr...

Control Dependence Segments or Instructions in a program may obtain control structures. Thus, dependency between the statements can also be in control structures. But the order

Which TTL logic gate is used for wired anding, Which TTL logic gate is used...

Which TTL logic gate is used for wired ANDing ? Ans. Open collector output, TTL logic gate is used.

Define busy waiting and spinlock, Define busy waiting and spinlock.  Wh...

Define busy waiting and spinlock.  When a process is in its critical section, any other process that tries to enter its critical section must loop continuously in the entry cod

Give an example of first fit and best fit algorithms, Given memory partiti...

Given memory partitions of 100k, 500k, 200k, 300k, and 600k (in order), apply first fit and best fit algorithms to place processes with the space requirement of 212k, 417k, 112k an

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