Computer Architecture - An Introduction

The instruction cycle, also known as the fetch-decode-execute cycle, is the fundamental operational process at the heart of every computer. This continuous cycle, from startup to shutdown, drives the CPU's activity. The method a program selects data during execution hinges on the addressing mode used in the instruction. Just as languages have different reading orders – English left-to-right, Arabic right-to-left – computers utilize endianness to define the order in which bytes are read from memory.

Endianness comes in two primary forms: Big-Endian (BE) and Little-Endian (LE). This dictates how multi-byte data is stored and accessed.

Instructions can be categorized based on the number of addresses they utilize:

• Zero Address Instructions: Instructions that don't require any memory addresses.
• One Address Instructions: Instructions that use a single memory address.
• Address Instructions: Instructions that use one or more memory addresses.
• Three Address Instructions: Instructions that use three addresses – typically for source, destination, and operand.

Computer memory is organized into five distinct hierarchies, each with varying speed and volatility:

• Registers: Fastest, volatile memory directly within the CPU.
• Cache: High-speed, volatile memory that stores frequently accessed data.
• Main Memory (RAM): Primary volatile memory for active programs and data.
• Magnetic Discs: Slower, non-volatile storage for long-term data.
• Magnetic Tapes: Slowest, non-volatile storage, often used for archiving.

To accomplish a task, a program – a sequence of instructions – is stored in memory. The processor retrieves individual instructions from memory, decodes them, and executes the corresponding operations. Data required for processing is also stored within these memory hierarchies. Understanding these concepts is crucial for anyone seeking to delve deeper into computer architecture and how software interacts with hardware.