Instruction |
Instruction Fetch |
Register Read |
Arithmetic Logic Unit (ALU) |
Memory Access |
Register Write |
Latency |
200ps |
100ps |
200ps |
300ps |
100ps |
a. (10 pts) What is the clock cycle time in a pipelined and non-pipelined processor?
Pipelined version : ______________
Non-pipelined version : ______________
b. The classic five-stage pipeline MIPS architecture is used to execute the code fragments. Assume the followings:
i. (5 pts) Assuming there is no dependence other than one(s) given in the code, show the pipeline diagram.
Clock Cycle -> |
1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 |
add R1, R2, R3 |
||||||||||||||||
add R4, R5, R6 |
||||||||||||||||
beq R1, R4, target |
||||||||||||||||
I4 |
a)
Pipelined Processor: Clock cycle time for a pipelined processor is determined the slowest stage i.e. it is equal to the time taken by the most time taking stage.
Non-Pipelined Processor: Clock cycle time for a non-pipelined processor is equal to the time taken by each stage.
Therefore,
Pipelined version: 300 ps
Non-Pipelined version: (200 + 100 + 200 + 300 + 100 ) ps = 900 ps
b)
Pipelined Diagram:
Clock Cycle -> |
1 |
2 |
3 |
4 |
5 |
6 |
7 |
8 |
9 |
10 |
11 |
12 |
13 |
14 |
15 |
16 |
add R1, R2, R3 |
IF |
ID |
EX |
MEM |
WB |
|||||||||||
add R4, R5, R6 |
IF |
ID |
EX |
MEM |
WB |
|||||||||||
beq R1, R4, target |
IF |
ID |
EX |
MEM |
WB |
|||||||||||
I4 |
IF |
ID |
EX |
MEM |
WB |
IF -> Instruction Fetch
ID -> Instruction Decode
EX -> Execute
MEM -> Memory
WB -> Write Back
The latencies of individual stages in five-stage MIPS (Microprocessor without Interlocked Pipeline Stages) Architecture are given...
The classic five-stage pipeline MIPS architecture is used to execute the code fragments in this problem. Assume the followings: The architecture fully supports forwarding, Register write is done in the first half of the clock cycle; register read is performed in the second half of the clock cycle, Branches are resolved in the third stage of the pipeline and the architecture does not utilize any branch prediction mechanism, Register R4 is initially 100. L1: lw R1, 0(R4) add R3, R1, R2 sw ...
4.10 In this exercise, we examine how resource hazards, control hazards, and Instruction Set Architecture (ISA) design can affect pipelined execution. Problems in this exercise refer to the following fragment of MIPS code: sw r16,12(r6) lw r16,8(r6) beq r5,r4,Label # Assume r5!=r4 add r5,r1,r4 slt r5,r15,r4 Assume that individual pipeline stages have the following latencies: (NOTE THESE ARE DIFFERENT VALUES THAN THE ONES IN OTHER SIMILAR QUESTIONS) IF ID EX MEM WB 250ps 100ps 175ps 150ps 200ps 4.10.4 [10] <§4.5>...
The classic five-stage pipeline MIPS architecture is used to execute the code fragments in this problem. Assume the followings: • The architecture fully supports forwarding, • Register write is done in the first half of the clock cycle; register read is performed in the second half of the clock cycle, • Branches are resolved in the third stage of the pipeline and the architecture does not utilize any branch prediction mechanism, • Register R4 is initially 100. L1: lw add...
c. The classic five-stage pipeline MIPS architecture is used to execute the code fragments. Assume the followings: Register write is done in the first half of the clock cycle; register read is performed in the second half of the clock cycle, Branches are resolved in the second stage of the pipeline and the architecture does not utilize any branch prediction mechanism Forwarding is fully supported Clock Cycle à 1 2 3 4 5 6 7 8 9 10 11 12...
he classic five-stage pipeline MIPS architecture is used to execute the code fragments in this problem. Assume the followings: The architecture fully supports forwarding, • Register write is done in the first half of the clock cycle; register read is performed in the second half of the clock cycle, • Branches are resolved in the third stage of the pipeline and the architecture does not utilize any branch prediction mechanism, • Register R4 is initially 100. Ll: lw add SW...
The classic five-stage pipeline MIPS architecture is used to execute the code fragments in this problem. Assume the followings: • The architecture fully supports forwarding, • Register write is done in the first half of the clock cycle; register read is performed in the second half of the clock cycle, • Branches are resolved in the third stage of the pipeline and the architecture does not utilize any branch prediction mechanism, • Register R4 is initially 200. L1: lw lw...
Question 11 add sw addi bne The classic five-stage pipeline MIPS architecture is used to execute the code fragments in this problem. Assume the followings • The architecture fully supports forwarding, • Register write is done in the first half of the clock cycle; register read is performed in the second half of the clock cycle, • Branches are resolved in the third stage of the pipeline and the architecture does not utilize any branch prediction med • Register R4...
help Question 11 The classic five-stage pipeline MIPS architecture is used to execute the code fragments in this problem. Assume the followings: • The architecture fully supports forwarding, • Register write is done in the first half of the clock cycle; register read is performed in the second half of the clock cycle, • Branches are resolved in the third stage of the pipeline and the architecture does not utilize any branch prediction mechanism, • Register R4 is initially 200....
add SW addi bne The classic five-stage pipeline MIPS architecture is used to execute the code fragments in this problem. Assume the followings: The architecture fully supports forwarding, • Register write is done in the first half of the clock cycle; register read is performed in the second half of the clock cycle, • Branches are resolved in the third stage of the pipeline and the architecture does not utilize any branch prediction mechanism, • Register R4 is initially 100....
The classic five-stage pipeline MIPS architecture is used to execute the code fragments. Assume the followings: Register write is done in the first half of the clock cycle; register read is performed in the second half of the clock cycle, Branches are resolved in the SECOND stage of the pipeline and the architecture does not utilize any branch prediction mechanism Forwarding is FULLY supported. Assuming there is no dependence other than one(s) given in the code, show the pipeline diagram....