779 views
0 votes
0 votes
Which of the following is not TRUE about "Delayed Branching" ?
S1 : Delayed branding changes the semantic meaning of the original program. 
S2 : Delayed branching is the problem arrived because of jump instruction.
(1) S1 only
(2) S2 only
(3) Both (1) & (2)
(4) None of these

Answer:3

1 Answer

0 votes
0 votes

S1 is False

The technique delayed branching tries to find an instruction which can be placed in branch delay slot which is not the instruction next to branch instruction because it will result in branch penalty. 

Instead, the compiler attempts to find a suitable instruction to occupy the delay slot, one that needs to be executed even when the branch is taken. It can do so by moving one of the instructions preceding the branch instruction to the delay slot. Of course, this can only be done if any data dependencies involving the instruction being moved are preserved. If a useful instruction is found, then there will be no branch penalty. If no useful instruction can be placed in the delay slot because of constraints arising from data dependencies, a NOP must be placed there instead. 

S2 is False 

Delayed branching is not any problem but a technique to reduce branch penalty.

Related questions

1 votes
1 votes
1 answer
1
sushmita asked Oct 20, 2016
1,183 views
can some one tell me any good resource to study delayed branching in computer architecture ?? Especially numerical examples.
0 votes
0 votes
1 answer
2
sh!va asked Jun 26, 2016
525 views
What element will be in root of B+ Tree after inserting (1,4,7,10,17,21,31,25,19,20). Assume branching factor is 4
1 votes
1 votes
1 answer
3
1 votes
1 votes
1 answer
4
gate_forum asked Oct 15, 2015
1,312 views
Compute utilization of token ring LAN where all stations are queued to send. Given the following parameters:ring length=5000 metressignal propagation=5 ns/mno. of station...