Advance Computer Architecture (CS501)
Assignment # 01
Total marks = 20
12th Nov 2019
Please carefully read the following instructions before attempting assignment.
RULES FOR MARKING
It should be clear that your assignment would not get any credit if:
The assignment is submitted after the due date.
The submitted assignment does not open or file is corrupt.
Strict action will be taken if submitted solution is copied from any other student or from the internet.
You should consult the recommended books to clarify your concepts as handouts are not enough.
You are supposed to submit your assignment in .doc or docx format.
Any other formats like scan images, PDF, zip, rar, ppt and bmp etc will not be accepted.
Objective of this assignment is to increase the learning capabilities of the students about
• Performance Measurement of a processor
• Performance Comparison of processors
• Classification of Instruction Set Architecture for different machines
No assignment will be accepted after the due date via email in any case (whether it is the case of load shedding or internet malfunctioning etc.). Hence refrain from uploading assignment in the last hour of deadline. It is recommended to upload solution file at least two days before its closing date.
If you find any mistake or confusion in assignment (Question statement), please consult with your instructor before the deadline. After the deadline no queries will be entertained in this regard.
For any query, feel free to email at:
Questions No 01 10 marks
Suppose we have a program which contains 200 instructions of different types. We want to execute this program on a 500 MHz processor. The ratio of each type of instruction in the program as well as clocks per instruction for each type of instruction is given below:
- Calculate the total execution time required by the processor to execute the program.
- If CPI for ALU is decreased by 20% and CPI for Load/Store is increased by 10%, then calculate the execution time.
Questions No 02 10 marks
Write assembly language program for 0-address and 1-address machines to evaluate the following expression.
D = A(B+C) – 2AC/B + C2
Note: A, B, C and D are memory labels.