IA1 Quiz

IA1

  • 📝 20 preguntas
  • ⏱ ~10 min
  • 👥 11 jugaron

Responde y descubre tu resultado.

💬 Comentar

🏆 Tabla de los mejores

  1. 🥇 1 H 100%
  2. 🥈 2 cinta 100%
  3. 🥉 3 cinta 100%
  4. #4 ana 100%
  5. #5 cinta 100%
  6. #6 Eduardo 95%
  7. #7 Eduardo 95%
  8. #8 Eduardo 95%
  9. #9 ana 95%
  10. #10 Eduardo 90%

✨ Parecidos

🔥 Quizzes populares

Comentarios · 0

Pregunta /

What kind of dependences can be eliminated using register renaming techniques?

Find dependencies in the following code sequence: St. 1. Loop: L.D F0, 0(R1) St. 2. ADD.D F4, F0, F2 St. 3. S.D F4,0(R1) St. 4. DADDUI R1,R1,-8 St. 5. BNE R1,R2,LOOP

Gustafson’s Law (speedup) says that:

What does it mean that network has blocking property?

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

When we have a loop-carried dependence?

Consider the mesh network with p processors as in figure below (no wraparoung connection). The communication time for one_to_all broadcast can be expressed by the following equation (m- message size):

RAW hazard is a consequence of:

When we use the reservation station and Tomasulo's Scheme, instruction is divided onto:

Hardward based speculation combines the following key ideas:

When using hardware based speculation we need to add additional step during instructions execution called commit. There are following types of commits:

What kind of partitioning should be used in parallel matrix multiplication algorithms

How we can define loop unrolling?

Duplication of data/ or computation takes place:

What kind of communication, and for wich architecture is implemented by the following program fragment: begin left: (my_id_1) mod p; right: (my_id_+1) mod p; result: my_msg; msg:=result; for i:1 to p-1 do begin send msg to right; receive msg from left; result: restul E msg; endofr end

What is a difference between store and forward and cut-trough routing mechanism?

When we used store and forward routing, total communication time can be expressed by the following equation

Consider the following code for(i=1; i<=100: i=i+1) x[2*I+3] = x[2*I-1]*5.0;

The parallel system is scalable if

Considerer the following omega network. Is it blocking network?

Tu resultado está listo. 🎁

¿Quieres guardarlo y ver tu historial? Crear cuenta →