1.1 Using the average instruction mix information for the program SPEC2000fp, find the percentage of all memory accesses (both data and instruction) that are for reads. Assume that two- thirds of data transfers are loads.

1.2 Compute the effective CPI for MIPS. Average the instruction frequencies for SPEC2000int and SPEC2000fp to obtain the instruction mix.

1.3 Consider an architecture that is similar to MIPS except that it supports update addressing for data transfer instructions. If we run SPEC2000int using this architecture, some percentage of the data transfer instructions will be able to make use of the new instructions, and for each instruction changed, one arithmetic instruction can be eliminated. If 25% of the data transfer instructions can be changed, which will be faster for SPEC2000int, the modified MIPS architecture or the unmodified architecture? How much faster? (Assume that both architectures have CPI values as given in the above table and that the modified architecture has its cycle time increased by 20% in order to accommodate the new instructions.)

2.1 Using C1 on both Il and 12, how much faster can the makers of I1 claim Il is compared to I2?

2.2 Which computer and compiler would you purchase if all other criteria are identical, including cost?

3.1 What will the speedup be if both improvements are made?

3.2 You are going to change the program described in Problem 3 so that the percentages are not 20%, 50%, and 30% anymore. Assuming that none of the new percentages is O, what sort of program would result in a tie with regard to speedup (i.e., the same speedup) between the two individual improvements? Provide both a formula and some examples.

4.1 We have a program of 1000 instructions in the format of "Iw, add, 1w, add, .. ." The add instruction depends (and only depends) on the 1w instruction right before it. The 1w instruction also depends (and only depends) on the add instruction right before it. If the program is executed on the pipelined datapath of Figure 1, what would be the actual CPI?

4.2 What would be the actual CPI for the program in Problen 4.1 without forwarding?

4.3 Consider executing the following code on the pipelined datapath of Figure 1. How many cycleswill it take to execute this code?

4.4 With regard to the code in Problem 4.3, explain what the forwarding unit is doing during the sixth cycle of execution. If any comparisons are bcing made, mention them.

110年 - 110 國立中山大學_碩士班招生考試_資工系(甲、乙組)：計算機結構#104310

109年 - 109 國立中山大學_碩士班招生考試_資工系(甲、乙組)：計算機結構#105754

108年 - 108 國立中山大學_碩士班招生考試_資工系(甲、乙組)：計算機結構#105762

107年 - 107 國立中山大學_碩士班招生考試_資工系(甲、乙組)：計算機結構#105781

106年 - 106 國立中山大學_碩士班招生考試_資工系(甲、乙組)：計算機結構#105788

105年 - 105 國立中山大學_碩士班招生考試_資工系(甲、乙組)：計算機結構#105824

104年 - 104 國立中山大學_碩士班招生考試_資工系(甲、乙組)：計算機結構#105827

103年 - 103 國立中山大學_碩士班招生考試_資工系(甲、乙組)：計算機結構#105837

102年 - 102 國立中山大學_碩士班招生考試_資工系(甲、乙組)：計算機結構#105879

101年 - 101 國立中山大學_碩士班招生考試_資工系(甲、乙組)：計算機結構#105905