Skip to content
TheCScience
TheCScience
  • Engineering Subjects
    • Human Values
    • Computer System Architecture
    • Digital Communication
    • Internet of Things
  • NCERT Solutions
    • Class 12
    • Class 11
  • HackerRank solutions
    • HackerRank Algorithms Problems Solutions
    • HackerRank C solutions
    • HackerRank C++ problems solutions
    • HackerRank Java problems solutions
    • HackerRank Python problems solutions
TheCScience
TheCScience

Instruction Cycle in Computer Architecture

YASH PAL, October 14, 2025February 4, 2026

Instruction Cycle in Computer Architecture – A program is defined as a collection of instructions to perform a specified operation. The program is normally stored in consecutive memory locations. The program is executed in the computer by going through a cycle for each instruction.

Each instruction cycle in turn is subdivided into a sequence of subcycles or phases. The control unit is responsible for taking care of all possibilities at every phase of the instruction cycle.

Instruction Cycle

In a basic computer system, an instruction cycle consists of the following phases :

  1. Instruction fetch
  2. Decode the instruction
  3. Calculate the effective address
  4. Operand fetch
  5. Instruction execution
  6. Save the result

Instruction Fetch

The instruction fetch cycle starts with the loading of the instruction address from the program counter (PC) to the address register (AR). The address register is connected to the address inputs of memory. It is necessary to transfer the address from the program counter to the address register during the clock transition. Now the control unit generates the control signal, read, to place the instruction from the memory unit to the instruction register (IR) with the next clock transition. At the same time, the program counter is incremented by one. Now it is ready to fetch the next instruction from the memory.

Following micro operations shows the instruction fetch subcycle.

T0        : AR ← PC
read, T1  : IR ← M[AR], PC ← PC+1

Decode the instruction

Once the instruction gets fetched from the memory unit, the meaning of that instruction is calculated by the instruction decoder of the processor. In a 16-bit instruction, twelve least significant bits (0-11) represent the address of the operand, next three bits (12-14) represent the operation code (opcode) which is to be performed on the operands. The most significant bit (15) is transferred to a flip-flop I, which indicates whether the address is direct or indirect.

Decoding of an instruction can be represented by the following micro operation.

T2 : D0,D1.......D7 ← Decode IR (12-14), AR ← IR (0-11), IF ← IR(15)

Calculate the effective address

An instruction is usually divided into parts, and each part has its own representation. One part of the instruction code specifies the operation code, another part provides the address of the operand, and the remaining part indicates that the provided address is direct or indirect. If the instruction shows the direct addressing scheme, then the address in the address field of the instruction is the effective address. For an indirect addressing scheme, the effective address has to be calculated by the processor from the contents of the address field of the instruction.

There are various addressing modes that are used in computer systems. Each addressing mode has its own way to calculate the effective address of the operand. These are discussed in the next section.

Operand Fetch

After calculating the effective address of the operand, the operand fetch subcycle is performed. If the operand is in main memory, the processor performs the memory read operation. The number of memory read subcycles depends on two factors: operand length and the memory word length. The control unit is responsible to keep a track of memory read cycles. If the operand is in a processor register, it will be read quickly compared to an operand from memory.

Instraction Execution

The operation code (opcode), provided in the instruction, specifies the exact micro operations in sequence to perform during the instruction execution. The execution process is controlled by the control unit of the computer. The number of micro operations performed depends on the meaning of the instruction. It varies from no micro-operation to multiple micro-operations.

Save the result

When the instruction execution is completed final result is stored. The result may be stored in the processor register or in a memory unit. It depends on the nature of the instruction.

Related Questions and Answers

Write the basic instruction processing steps.

In the simplest way, instruction processing consists of two steps: (i) the processor reads instructions from memory one at a time and (ii) executes each instruction

What is the instruction cycle and opcode fetch?

The processing required for a single instruction is called an instruction cycle. Each instruction cycle begins with the reading operation of one instruction from memory. This is called a fetch operation.

Which processor register is responsible for the sequencing of the instruction execution?

The program counter (PC) is a register responsible for the sequencing of instruction execution.

Computer System Architecture engineering subjects Computer System Architectureengineering subjects

Post navigation

Previous post
Next post

Computer Architecture fundamentals
Development of Computers
Von Neuman and Harvard machine Architecture
Flynn Classification
Computer Structure Architecture
Interfacing Logic Devices
Levels of Design abstraction
Performance Metrics

Register Transfer Language
Memory Transfer
Arithmetic Micro-operations
Logic Micro-operations
Shift Micro-operations
Bus Architecture
Data Transfer
Central Processing Unit
CPU Bus Architecture

Computer Register and Types
Common Bus System
Instruction Format
Instruction Types
Instruction Cycle
Addressing Modes
Design of a basic computer

Basic function of a Computer
General register organization
Stack organization
Infix to Reverse Polish Notation Conversion
Instruction Types and their classifications
Data transfer and manipulation
Program control
RISC characteristics
CISC characteristics

Pipeline
Types of Pipeline
Arithmetic Pipeline
Instruction Pipeline
Hazards
Vector Processing

Data Representation
Addition and Subtraction
Adder Circuits
Shift and Add Multiplication Method
Booth's Algorithm
Restoring Division Algorithm
Non-Restoring Division Algorithm
Array Multiplier

Memory Classification
Memory Characteristics
Memory Organization
Memory Types
Associative Memory
Cache Memory
Virtual Memory

Input Output Interface
Modes of Data Transfer
Priority Interrupt
Direct Memory Access
Input-Output Processor
Serial Communication

TheCScience

We at TheCScience.com are working towards the goal to give free education to every person by publishing in dept article about Secondary, Senior-Secondary, and Graduation level subjects.

Pages

About US

Contact US

Privacy Policy

DMCA

Engineering Subjects

Internet of Things

Human Values

Digital Communication

Computer System Architecture

Programming Tutorials

Data Structure and Algorithm

C

Java

NCERT

Class 12th

©2026 TheCScience | WordPress Theme by SuperbThemes