IA2

Question 1

Consider a loop branch whose behavior is taken nine time in a row, then not taken once. What is the prediction accuracy for this branch, assuming that we use a 2-bit prediction scheme?

Accepted Answer

NO correct answer

Answer

80%

Answer

95%

Answer

83%

Question 2

Consider the following code: 
for ( l=1; l<=100; l++)
{ 
X[2*I+3]=x[2*l]*5.0;
} 
The GCD test gives you the following answer:

Accepted Answer

The dependence doesn't exist

Answer

exists dependence

Answer

No GCD

Answer

NO correct answer

Question 3

WAW hazard is a consequence of:

Accepted Answer

Output dependence

Answer

Control dependence

Answer

Flow dependence

Answer

Antidependence

Question 4

Using geometric means of normalized execution times…

Accepted Answer

we can easily predict the execution time.

Answer

we cannot predict the execution time.

Answer

depending on the workload, sometimes we can predict the execution time

Answer

no correct answer.

Question 5

Suppose that you execute parallel program using 20 processors, the sequential fraction of your program is 10%. What is speedup which can be achieved?

Accepted Answer

~10

Answer

~5

Answer

~20

Answer

No correct answer

Question 6

22. Consider the following code:

for(I=1; I<=100; I=I+1)
{
	x[2*I+3]=X[2*I-2]*3.0;
}

The GCD test gives you the following answer:

Accepted Answer

No dependences is possible

Answer

The dependence exists

Answer

You cannot use GCD test for above example

Answer

No correct answer

Question 7

Amdhal Law say that (software approach):

Accepted Answer

Speedup is limited by parallel fraction of the program

Answer

There are no any speedup limitation

Answer

Speedup increase linearly with the number of used processors

Answer

No correct answer.

Question 8

When we used CT routing, total communication time can be expressed by the following fraction (l - the number of communication lines used, m - the size of message):

Accepted Answer

tcomm= ts + mtw + lth

Answer

tcomm= ts + (mtw + th)

Answer

tcomm= (ts + mtw + th)l

Answer

No correct answer

Question 9

What kind of communication, and for which architecture is implemented by the following code:
 result:= my_msg;
for i:=0 to d-1 do
begin
	partner:= my_id XOR 2;
	send result to partner;
	receive msg from partner;
	result := result U msg;
endfor

Accepted Answer

no correct answer

Answer

all_to_all for mesh architecture

Answer

one_to_all for hypercube

Answer

all_to_all for hypercube

Question 10

When we compare the Loop Shrinking and the Node Splitting transformations we can conclude that:

Accepted Answer

The Loop Shrinking transformation gives better result when we parallelized a loop.

Answer

There are no any differences between both transformations when we used in for loop parallelization.

Answer

The Node Splitting transformation gives better result when we parallelized a loop.

Answer

No correct answer.

IA2

🏆 Tabla de los mejores

✨ Parecidos

Evaluación Unidad 2

Evaluacion Unidad 3

Evaluación Unidad 1

Evaluacion Unidad 5

Evaluacion Unidad 4

HISTORIA

🔥 Quizzes populares

cambios de estados

leyes de Newton

Test Cultura Griega

¿Puedes reconocer a estos científicos famosos?

Evaluación sumativa Formador de Formadores

Cinemática

Comentarios · 0

Consider a loop branch whose behavior is taken nine time in a row, then not taken once. What is the prediction accuracy for this branch, assuming that we use a 2-bit prediction scheme?

Consider the following code: for ( l=1; l<=100; l++) { X[2I+3]=x[2l]*5.0; } The GCD test gives you the following answer:

WAW hazard is a consequence of:

Using geometric means of normalized execution times…

Suppose that you execute parallel program using 20 processors, the sequential fraction of your program is 10%. What is speedup which can be achieved?

22. Consider the following code: for(I=1; I<=100; I=I+1) { x[2I+3]=X[2I-2]*3.0; } The GCD test gives you the following answer:

Amdhal Law say that (software approach):

When we used CT routing, total communication time can be expressed by the following fraction (l - the number of communication lines used, m - the size of message):

What kind of communication, and for which architecture is implemented by the following code: result:= my_msg; for i:=0 to d-1 do begin partner:= my_id XOR 2; send result to partner; receive msg from partner; result := result U msg; endfor

When we compare the Loop Shrinking and the Node Splitting transformations we can conclude that:

IA2

🏆 Tabla de los mejores

✨ Parecidos

Evaluación Unidad 2

Evaluacion Unidad 3

Evaluación Unidad 1

Evaluacion Unidad 5

Evaluacion Unidad 4

HISTORIA

🔥 Quizzes populares

cambios de estados

leyes de Newton

Test Cultura Griega

¿Puedes reconocer a estos científicos famosos?

Evaluación sumativa Formador de Formadores

Cinemática

Comentarios · 0

Consider a loop branch whose behavior is taken nine time in a row, then not taken once. What is the prediction accuracy for this branch, assuming that we use a 2-bit prediction scheme?

Consider the following code: for ( l=1; l<=100; l++) { X[2*I+3]=x[2*l]*5.0; } The GCD test gives you the following answer:

WAW hazard is a consequence of:

Using geometric means of normalized execution times…

Suppose that you execute parallel program using 20 processors, the sequential fraction of your program is 10%. What is speedup which can be achieved?

22. Consider the following code: for(I=1; I<=100; I=I+1) { x[2*I+3]=X[2*I-2]*3.0; } The GCD test gives you the following answer:

Amdhal Law say that (software approach):

When we used CT routing, total communication time can be expressed by the following fraction (l - the number of communication lines used, m - the size of message):

What kind of communication, and for which architecture is implemented by the following code: result:= my_msg; for i:=0 to d-1 do begin partner:= my_id XOR 2; send result to partner; receive msg from partner; result := result U msg; endfor

When we compare the Loop Shrinking and the Node Splitting transformations we can conclude that:

Consider the following code: for ( l=1; l<=100; l++) { X[2I+3]=x[2l]*5.0; } The GCD test gives you the following answer:

22. Consider the following code: for(I=1; I<=100; I=I+1) { x[2I+3]=X[2I-2]*3.0; } The GCD test gives you the following answer: