Scribd
Upload
17 views

CS704 Mid Term

Uploaded by

Muhammad Zeeshan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
17 views

CS704 Mid Term

Uploaded by

Muhammad Zeeshan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

1. Why chip set volume size increasing ... Decrease the cost.

2. Dynamic and static scheduling


3. Calculate Speedup with given values of former procsr 5ns and later 1ns
4. A new branch predictor with state diagram of 3 states.. countin performence

cs704 paper
Computer A Computer B
Program 1 2sec 4sec
Program 2 5 sec 2sec
Tell following statements , true or false. 5 marks
a) A is faster then B for program 1
b) A is faster than B for Program 2
c) A is faster than B for a work load with equal no of execution of program 1& 2
d) A is faster than B for a work load with twice As many as execution of program 1 as of
program 2
Question. We have a single stage, non-pipelined machine and a pipelined machine with 5
pipeline stages. The cycle time of the former is 5 ns and the latter is 1ns.
a. Assuming no stalls, what is the speedup of the pipelined machine over the single stage
machine?
Question.
(a) What is static branch prediction and what is the downside to it?
(b) (b) Why it is important for Tomasulo’s to issue instruction in-order?
c) What is the limiting factor of Tomasulo’s performance
question. Static and dynamic scheduling?

07/04/2018

Cost of comp A $600 Cost of Comp B $900


Execution of prog1 on Comp A was 2 sec n on Comp B was 1.5 sec
We had to tell which computer to purchase for multiple prog1 execution. 5marks
2- die size n defect rate n @ was given
We had 2 compute die yield 5marks
3- code of assembly Lang was given n we had 2 trace data dependencies and also
anti-dependencies in d code 15marks
4- 4gotton

07/01/2018
No MCQ. Total 4 Questions , 3 of 5 marks and 1 of 15 marks
1. Enlist two advantages and disadvantages of register to register architecture.5 marks
2. Compare performance of two computers and find which computer is faster than other for
each program
Program1. Time on A=2 sec Time on B =1.5 sec
Program2. Time on A=5 sec Time on B =10 sec
(5 marks)
3. Find the die yield for a processor chip with the following manufacturing cost factors: die
size = 380 mm2, estimated defect rate = 0.75 per cm2, α = 4. (5 marks)
4. For (i=2; i<100; i= i+1)
{
a[i] = b[i] + a[i]; /*s1*/
c[i-1] = a[i] + d[i]; /*s2*/
a[i-1] = 2* b[i]; /*s3*/
b[i+1] = 2*b[i]; /*s4*/
}
Find all true, output and anti dependencies in this loop and also loop carried dependencies.
Indicate whether the true dependences are loop carried or not?Why loop is not parallel? (15
marks)

05/30/2024
1. What are the limitations of Tomasulo's Algorithm?
2. What is static branch prediction and what is the downside to it?
3. We wish to compare the performance of two different computers: A and B. While
executing a program P, the following measurements have been made on these
computers:

4. Consider the equation


a*b-a*c
How can we optimize that instruction so that system consumes minimum time for
execution?
5. We have a single stage, non-pipelined machine and a pipelined mac ine wit 5 p pe Ine
stages. T e cycle time of the former is 5 ns and the latter is Ins. Assuming no stalls, what
is the speedup of the pipelined machine over the single stage machine?
06/03/2024
1. Ik macnitosh aur 3 pc pentoum 4, in k true false they
2. PCA abd PC waaley True False they
3. Scoreboard waalaa tha ADD R2<- R1, R4
4. Ik transition diagram thii Predict taken waali
5. Ik tha B is slower than A 10 sec aur 15 second given they

12/12/2024
1. Four statements were asked to identify whether they were true or not.
2. Which Prediction Method (Branch Taken, Not Taken, Dynamic) is best suited for the
scenario in which no penalty for correct prediction, 2 cycles for wrong prediction whereas
5% of the time branch is taken and dynamic prediction predicts correctly 90% of the
time. (5 marks)
3. Which is faster Computer A or computer B, program 1 & 2 (2 sec , 1 .5 sec, 5sec,
10sec).
4. Yaad nahi ha. Previous papers main se nahi aya.
5. A branch prediction method was given (FSM diagram) (10 marks)
(a) What behavior does this new method of branch prediction show?
(b) In which assumptions does it perform better than the standard 2-bit prediction
method?

12/13/2024
1. ( a x b - a x c) men multiply 10ns or sub 1ns leta hy. Rewrite if it is optimizable.
2. Mov.s or mov.d men difference
3. Commit or ROB k advantages
4. Comp A or Comp B k times thy. True false btany thy
5. (Long) Static branch prediction and downside of it.
And limitations of tomasulo
12/13/2024
1. There are four different computers one is apple macintosh based, second and third are
intel pentium 4 and petiumX (same architecture and instruction set) and forth is amd
(same instruction set as intel). Answer the following either true or false:
a. Can we tell which is fastest based on clock rate.
b. If all have same intel architecture then can we tell which is faster based on clock
cycle rate.
c. Intel pentium 4 and pentiumX are the same processor, can we predict which of
both is faster.
d. Can we predict their speed based on benchmark score.
2. We wish to compare the performance of two different computers: A and B. While
executing a program P, the following measurements have been made on these
computers:

Calculate execution speed (instructions per second) for both computers.


3. Which Prediction Method (Branch Taken, Not Taken, Dynamic) is best suited for the
scenario in which no penalty for correct prediction, 2 cycles for wrong prediction whereas
5% of the time branch is taken and dynamic prediction predicts correctly 90% of the
time. (5 marks)
4. Zero penalty on predict not taken, 2 cycles penalty on predict taken and accuracy of
dynamic predict is 90%. Which one is good if the frequency is 5%.
5. Consider the following prediction branch and answer the following questions:

a. How it is different than standard 2-bit prediction?


b. How it is efficient than standard 2-bit prediction?

You might also like