Computer Organization II,  Autumn 2010, HW 5

1. Problems 12.8 and 12.11 [Stal10, Stal06]                                 (--, 12.3 [Stal03])
   "12.8. Assume pipeline with 4 stages: Fetch instruction (FI), decode instr and calculate addresses (DA), fetch operand (FO), and execute (EX). Draw a diagram similar to Figure 12.10 for a sequence of 7 instructions, in which the 3rd instruction is a branch that is taken and in which there are no data dependencies."
    
2. Problem 12.13 [Stal10, Stal06]                                 (12.5 [Stal03])
   Also,
   1. Give an example on situation, where the algorithm in Figure 12.19 [Stal10] (Fig 12.17 [Stal06, Stal03]) would be better than the two other alternatives.
   2. Give an example on situation, where the left side algorithm in Figure 12.28 [Stal10] (Fig 12.25 [Stal06, Stal03]) would be better than the two other alternatives.
   3. Give an example on situation, where the right side algorithm in Figure 12.28, [Stal10] (Fig 12.25 [Stal06, Stal03]) would be better than the two other alternatives.
      
      
3. Problem 13.1 [Stal10, Stal06, Stal03]
   Problem has different window sizes in different versions of text book.
   Use these: (a) 5?, (b) 7?, and (c) 17?.
     
4. Problem 13.4 [Stal10, Stal06]                                              (--- [Stal03])   
   "Reorganize the code sequence in Fig. 13.6d [Stal10, Stal06, Stal03] to reduce the number of NOOPs required."
   Hint: Use delay slots.
     
5. Problems 13.6 and 13.9 [Stal10, Stal06]                        (13.5 and 13.7 [Stal03])   
   In Problem 13.6, consider also part (b) added to latest edition [Stal10]:
   2. "Can you think of an alternative way to modify the code so that the delayed branch mechanism can be used?"