Illustrate the execute cycle, Computer Engineering

Assignment Help:

Q. Illustrate the Execute Cycle?

The fetch and indirect cycles include a small, fixed sequence of micro-operations. Every one of these cycles has fixed sequence of micro-operations which are common to all instructions. 

This isn't true of the execute cycle. For a specific machine with N different opcodes there are N different sequences of micro-operations which can occur. Let's consider some hypothetical instructions:

An add instruction which adds the contents of memory location X to Register R1 with R1 storing the result:

ADD R1, X

Sequence of micro-operations can be:

T1:  MAR ← IR (address)

T2:  MBR ← [MAR]

T3:  R1     ← R1 + MBR

At the beginning of execute cycle IR comprises the ADD instruction and its direct operand address (memory location X). At time T1 address part of the IR is transferred to MAR. At T2 the referenced memory location is read in MBR.

Lastly at T3 contents of R1 and MBR are added by ALU. 

Let's discuss one more instruction:

ISZ X it increments content of memory location X by 1. If the result is 0 the subsequent instruction in the sequence is skipped. A possible sequence of micro-operations for this instruction can be:

 T1:  MAR ← IR (address)

         T2:  MBR ← [MAR]

         T3:  MBR ← MBR+ 1

         T4:  [MAR] ← MBR

 If (MBR = 0) then (PC ← PC+ I)

Please remember that for this machine we have presumed that MBR can be incremented by ALU directly.

PC is incremented if MBR comprises 0. This test and action can be applied as one micro-operation. Please note also that this micro-operation may be executedat the time of the same time unit during which updated value in MBR is stored back to memory.


Related Discussions:- Illustrate the execute cycle

Average data transfer rate in floppy, Q. Average data transfer rate in flop...

Q. Average data transfer rate in floppy? A floppy is about 0.64 mm thick and is available in diameters 5.25 inch and 3.5 inch. Data are arranged in form of tracks and sectors.

How does bus arbitration typically work, How does bus arbitration typically...

How does bus arbitration typically work? i.  A bus master waiting to use the bus asserts by  the bus request. ii.  A bus master cannot be the bus until it's request is grant

Gui status in a program from the object browser, Can we create a gui status...

Can we create a gui status in a program from the object browser? Yes.  You can make a GUI STATUS in a program using SET PF-STATUS.

What are the features of ado.net, What are the features of ADO.Net ?  A...

What are the features of ADO.Net ?  ADO.NET features: 1. Disconnected Data Architecture 2. Data cached in Datasets 3. Data transfer in XML format 4. Interaction wit

Explain direct addressing mode with example, Q. Explain Direct Addressing M...

Q. Explain Direct Addressing Mode with example? Direct Addressing Mode A direct operand signifies to contents of memory at an address referred by the name of the variable.

Lifo under perpetual inventory procedure, Q. LIFO under perpetual inventory...

Q. LIFO under perpetual inventory procedure? LIFO under perpetual inventory procedure observes Exhibit to see the LIFO method using perpetual inventory procedure. In this proce

What is interpolated resolution, Q. What is Interpolated Resolution? Ev...

Q. What is Interpolated Resolution? Every Scanner is accompanied by a software. This software can raise the apparent resolution of scan by a scheme known as Interpolation.  By

Illustrate the working of encoders, Q. Illustrate the working of Encoders? ...

Q. Illustrate the working of Encoders? An Encoder performs reverse function of decoder. An encoder has 2n input lines and 'n' output line. Let's see 8 ×3 encoder that encodes 8

ASP.NET, I have developed a web application in .net & if the web applicati...

I have developed a web application in .net & if the web application is idle for some time & after that if we perform some action on that web page then it doesn''t respond. Can you

Carry look-ahead adder and booth''s algorithm, Describe carry look-ahead ad...

Describe carry look-ahead adder? Ans: The input carry required by a stage is directly computed from carry signals obtained from all of the preceding stages i-1,i-2,.....0, rat

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd