The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+44 votes
6.5k views

Consider a three word machine instruction

$ADD A[R_0], @B$

The first operand (destination) “$A[R_0]$” uses indexed addressing mode with $R_0$ as the index register. The second operand (source) “[email protected]$” uses indirect addressing mode. $A$ and $B$ are memory addresses residing at the second and third words, respectively. The first word of the instruction specifies the opcode, the index register designation and the source and destination addressing modes. During execution of $ADD$ instruction, the two operands are added and stored in the destination (first operand).

The number of memory cycles needed during the execution cycle of the instruction is:

  1. $3$
  2. $4$
  3. $5$
  4. $6$
asked in CO & Architecture by Veteran (59.7k points)
edited by | 6.5k views
0

thiz is right answer

consider thiz The number of memory cycles needed during the execution cycle of the instruction is:

nd solve u reach 4 as answer

0

Refer  Heading -> 3. Two address instructions  in http://www.cs.iit.edu/~cs561/cs350/fetch/fetch.html.

+9

@Arjun sir @Bikram Sir is everything correct here ?https://www.cs.umd.edu/class/sum2003/cmsc311/Notes/CompOrg/fetchDecode.html

0

@junaid ahmad 

is everything correct here ?

No. refer @reena_kandari's comment in selected answer.

0
@Chhotu Can you mention specifically what's wrong in here .
0
i dont think something is wrong in his diagram ..
0

http://www.cs.iit.edu/~cs561/cs350/fetch/fetch.html 

@Arjun sir this link has a mistake actually in 2 and 3 address instructions once we fetch the instruction MAR points to the first word of the instruction and then as we increment MAR by 1 we get the NEXT INSTRUCTIONS ADDRESS we dont get the operands address directly hence we need to fetch those extra two words into temporary registers and then further fetch the operands present in those addresses into the registers 

0

A link is not working. please update it @junaid ahmad 

0
@junadahmed the depiction of stages is wrong, as the effective address calculation and ALU operation is performed in the EX stage rather than OF stage, operands are fetched in ID stage itself and the address calculation after the operands are fetched is done through the ALU unit available in the EX stage, see the MULTICYCLE and SINGLE CYCLE implementation of DATA PATH in a CPU.
0
Any conclusions regarding the final answer. I strongly think that the answer has to be 6. 2MR for ID, 1RR & 1MR for source 1, 2 MR for source 2, 1 ALU to process data, 1 MR to WB.

So finally 6 MR should be there. Please let me know if I am wrong.

4 Answers

+71 votes
Best answer

$1$ $\text{memory read}$ to get first operand from memory address $A+R_0$ ($A$ is given as part of instruction)
$1$ $\text{memory read}$ to get address of second operand (since second uses indirect addressing)
$1$ $\text{memory read}$ to get second operand from the address given by the previous memory read
$1$ $\text{memory write}$ to store to first operand (which is the destination)

So, totally $4$ memory cycles once the instruction is fetched.

The second and third words of the instruction are loaded as part of the Instruction fetch and not during the execute stage.
Reference: http://www.cs.iit.edu/~cs561/cs350/fetch/fetch.html

answered by Veteran (369k points)
edited by
0
I think, This is clearly $CISC$ architecture, So we include write back in execution step. But Had it been $RISC$ then we wouldn't have included write back in execution.

$5$ stages story is primarily of $RISC$ only.
0
good explanation @habib khan
0

@arjun sir , 2nd and 3rd word of the instruction only known after decoding the opcode fetched in instruction fetch , then decode fetch must be comes under executuion phase , then 2 extra mr will make 6 memory references, here i m sharing the carl hamachar line in which in fetch cycle only instruction is loaded in instruction register , 

0
@saket nandan

Yeah,in Carl hamacher it's direct written that fetching operands from memory or processor registers are to be counted under instruction execute phase.

And there are only 2 phases- instruction fetch(which is only fetching instruction from memory) and second is instruction execute, which is everything left to do.

 

So operand fetch is under instruction execute.

Accordingly, 6 cycles are needed.
0
Instruction decode phase is part of Fetch Cycle.

Source-Hamacher 5th edition pg 412,413 under heading 7.1 "Some fundamental concepts"
0
@Ayush Upadhyaya

just read the last paragraph(till the last last line of that paragraph) of page 43 of the same book you've mentioned completely.
0
In cases where an instruction occupies more than one word

Step 1: Fetch the contents of the memory location pointed to by PC.

Step 2: Increment PC by one word

both above steps must be repeated as many times as necessary to fetch the complete instruction. These two steps are usually referred to as the fetch phase.

Step3:(Execution Phase)Carry out actions specified by the instruction in the IR.

Where I went wrong?
+2
@Ayush Upadhyaya

you seems right and the answer should be 4. and answer is 4 not because decode step is considered in the fetch cycle but due to the fact that the given instruction is 3 word instruction and 2nd and 3rd words are the addresses A and B respectively, so no need for further decode step. had it been given that the instruction is single word, then the answer would be 6. what do you think? am i right?
0
But, even if the instruction is of 3 words and in 1 machine cycle CPU can fetch only one word, how can the cpu continue with execution of an instruction which has not been completely fetched.So, 2 more machine cycles are required for fetching instruction completely.
0

@aambazinga i am completely agree with you.

+4 votes
indirect addressing mode will take 2 memory cycles and A[R0] will take 1  memory cycles... Total 4 memory cycles .. Here equation is  A[R0] = A[R0] + @B ...  where A and B are memory addresses ...  A[R0] will be interpreted as A+M[R0] which will produce a memory address ... so 1 memory cycle for it .. So Total 1+1+2 = 4 ...
answered by Boss (11.8k points)
+3 votes
B) as Memory[ A+R0 ]<--Memory[ A+R0 ] + Memory[memory[B]]
answered by Loyal (6.9k points)
edited by
0

 Memory[A] is given as part of the instruction. 

+1
Sir ,Which line indicates that Mem[A] is part of inst. i am not able to get this :/
+1
@kalpish

thiz one The first word of the instruction specifies the opcode, the index register designation and the source and destination addressing modes
0 votes

 

ADD A[R0], @B;

 

ANSWER : 6

 

A TOTAL OF 6 MEMORY ADDRESS NEED TO BE ACCESSED TIN ORDER TO PERFORM THE INSTRUCTION.

 

 

THE ABOVE CODE CONTAINS 3 PARTS:

1. DISPLACEMENT ADDRESSING  A[R0] 

2. INDIRECT ADDRESSING @B  

3. ARITHMETIC OPERATION / STORE RESULT ADD

 

 

1. A[R0] RESULTS IN 3 MEMORY ACCESS

EFFECTIVE ADDRESS IS CALCULATED AS

A[R0] = A + (R0)

A[R0] IS  A TYPE OF DISPLACEMENT ADDRESSING MODE IN WHICH THE FINAL MEMORY [A+R0] IS ACCESSED BY ADDING THE BASE ADDRESS "R0" TO THE DISPLACEMENT ADDRESS "A"

  

2. @B FETCHED THE OPERAND IN 2 MEMORY ACCESS SINCE IT IS AN INDIRECT ADDRESSING MODE.

3. ONE MORE MEMORY ACCESS IS REQUIRED IN ORDER TO STORE THE FINAL ADD RESULT IN THE DESTINATION ADDRESS.

 

A TOTAL OF 6 MEMORY ADDRESS NEED TO BE ACCESSED TIN ORDER TO PERFORM THE INSTRUCTION.

  

answered by (15 points)
+1
@arjun Sir

Execution Cycle contains - ID( instruction decode), Operand Fetch, Process Data(ALU) +Write Back(if any)

total of 6 cycles are needed to execute this.

Decode Phase - 2 Memory Reference

Operand fetch phase -

    for 2nd Source (@B)  - 2 memory reference to get data

    for 1st Source(A[r0]) - 1 memory reference to get data

Write back phase ( A[r0) <- A(r0) + @B) - 1 memory reference to write data at memory location pointed by (A+r0) address

 

So total of 6 memory reference in execute cycle.

Please explain how 4 Memory references  are needed in this?
Answer:

Related questions



Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

44,284 questions
49,774 answers
164,289 comments
65,856 users