Scribd
Upload
34 views

CH 2

This document discusses the basic architecture and components of an x86 processor, including the central processing unit (CPU), registers, clock, control unit, arithmetic logic unit (ALU), and system bus. It describes how a single machine instruction is executed in three steps: fetch, decode, and execute. It also covers related topics like reading from memory, how programs run, multitasking, and interrupts.

Uploaded by

Prince Ali Jehangir
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
34 views

CH 2

This document discusses the basic architecture and components of an x86 processor, including the central processing unit (CPU), registers, clock, control unit, arithmetic logic unit (ALU), and system bus. It describes how a single machine instruction is executed in three steps: fetch, decode, and execute. It also covers related topics like reading from memory, how programs run, multitasking, and interrupts.

Uploaded by

Prince Ali Jehangir
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 21

x86 Processor

Architecture
Basic Microcomputer Design

 The central processor unit (CPU), where calculations and logic operations
take place, contains a limited number of storage locations named registers , a
high-frequency clock, a control unit, and an arithmetic logic unit.

 The clock synchronizes the internal operations of the CPU with other system
components.

 The control unit (CU) coordinates the sequencing of steps involved in


executing machine instructions.
Basic Microcomputer Design

 The arithmetic logic unit (ALU) performs arithmetic operations such as


addition and subtraction and logical operations such as AND, OR, and NOT.
Basic Microcomputer Design

 Each operation involving the CPU and the system bus is synchronized by an
internal clock pulsing at a constant rate.
 The basic unit of time for machine instructions is a machine cycle (or clock
cycle).

 A clock that oscillates 1 billion times per second (1 GHz).


 Clock cycle=1 nanosecond.
Instruction Execution Cycle

 The execution of a single machine instruction can be divided into a sequence


of individual operations called the instruction execution cycle
 The instruction pointer contains the address of the next instruction
 The instruction queue holds a group of instructions about to be executed.
 Executing a machine instruction requires three basic steps: Fetch,
 Decode , and Execute.
Instruction Execution Cycle

 Fetch: The control unit fetches the next instruction from the instruction
queue and increments the instruction pointer (IP). The IP is also known as the
program counter
 Decode: The control unit decodes the instruction’s function to determine
what the instruction will do. The instruction’s input operands are passed to
the ALU, and signals are sent to the ALU indicating the operation to be
performed.
 Fetch operands: If the instruction uses an input operand located in memory,
the control unit uses a read operation to retrieve the operand and copy it into
internal registers. Internal registers are not visible to user programs.
Instruction Execution Cycle

 Execute: The ALU executes the instruction using the named registers and
internal registers as operands and sends the output to named registers and/or
memory. The ALU updates status flags providing information about the
processor state.
 Store output operand: If the output operand is in memory, the control unit
uses a write operation to store the data.
Instruction Execution Cycle

loop
fetch next instruction
advance the instruction pointer (IP)
decode the instruction
if memory operand needed, read value from memory
execute the instruction
If result is memory operand, write result to memory
continue loop
Reading from Memory

 Program throughput is often dependent on the speed of memory access


 CPU clock speed might be several gigahertz, whereas access to memory
occurs over a system bus running at a much slower speed.
 The CPU must wait one or more clock cycles until operands have been fetched
from memory
 The wasted clock cycles are called wait states.
 conventional memory is so much slower than the CPU, computers use
high-speed cache memory to hold the most recently used instructions and data.
Reading from Memory
How Programs Run

 The operating system (OS) searches for the program’s filename in the current
disk directory.
 The OS retrieves basic information about the program’s file from the disk
directory, including the file size and its physical location on the disk drive.
 The OS determines the next available location in memory and loads the
program file into memory. Enters information about the program’s size and
location into a table (sometimes called a descriptor table )
How Programs Run

 The OS begins execution of the program’s first machine instruction. As soon


as the program begins running, it is called a process . The OS assigns the
process an identification number ( process ID ), which is used to keep track of
it while running.
 The process runs by itself. It is the OS’s job to track the execution of the
process and to respond to requests for system resources. Examples of
resources are memory, disk files, and input-output devices.

 When the process ends, it is removed from memory.


Multitasking

 A multitasking operating system is able to run multiple tasks at the same


time.
 A task is defined as either a program (a process) or a thread of execution.
 A thread shares its memory with other threads belonging to the same process.
 Web browsers use separate threads to simultaneously load graphic images and
respond to user input.
 Playing video with downloading it.
Multitasking

 Most modern operating systems simultaneously execute tasks that


communicate with hardware, display user interfaces, perform background file
processing, and so on.
 A CPU can really execute only one instruction at a time, so a component of
the operating system named the scheduler allocates a slice of CPU time
(called a time slice ) to each task.
 By rapidly switching tasks, the processor creates the illusion they are running
simultaneously.
 One type of scheduling used by the OS is called round-robin scheduling.
Multitasking
Multitasking

 A multitasking OS runs on a processor (such as the x86) that supports task


switching
 The processor saves the state of each task before switching to a new one.
 A task’s state consists of the contents of the processor registers, program
counter, and status flags, along with references to the task’s memory
segments.
 A multitasking OS will usually assign varying priorities to tasks
 A preemptive multitasking OS (such as Windows XP or Linux) permits a higher-
priority task to interrupt a lower-priority one.
 An locked application program is restored by keyboard buttons.
Interrupt

 Interrupt the normal sequencing of the processor


 Most I/O devices are slower than the processor
 Processor must pause to wait for device
 Interrupt transfers control to the interrupt service routine generally, through
the interrupt vector, which contains the addresses of all the service routines
 Interrupt architecture must save the address of the interrupted instruction
 A trap is a software-generated interrupt caused either by an error or a user
request
Interrupt Handler

 Program to service a particular I/O device


 Generally part of the operating system
Interrupt
Multiple Interrupt

 Disable interrupts while an interrupt is being processed


Multiple Interrupt

 Define priorities for interrupts

You might also like