Lecture 2 - Fetch, Execution and IO

-

 Data is stored in Bits

1 byte = 8 bits

Bit - the smallest unit of data measurement in computer.

      - it can be either 0 or 1.

Pulse of 5 volts of electricity = 1bit

Pulse of 0 volts of electricity = 0

1 bit - presence of light

0 bit - absence of light

A "byte" is a collection of 8 bits.


Functional units

1. Primary memory (main memory)

- Organized into words of typically 32 bits (contains four 8-bit bytes)

- Programs and their data must be in memory to be executed.

2. Cache memory (smaller and faster than main memory)

- Holds sections of the program and data currently/frequently being executed.

3. Processor

- Logic circuits: for performing arithmetic and logic operations on word-size data operands.

- Timing and control circuits: for fetching program instructions and data from memory, one after another.

- Registers (typically 16 or 36): holds one word of operand data sections of the program and data currently/frequently being executed.

 Computer

- Computer accepts information in the form of programs and data and stored in the memory.

- Information stored in the memory is fetched under program control into an ALU, where it's processed.

- Processing information leaves the computer through an output unit.

- All activities in the computer are directed by the Control Unit.


Instruction Cycle (single cycle operation, machine cycle)

Computer system's own basic operation is very simple.

It can repeat the basic operations billions of times per seconds.

Steps:

1. Fetch the instructions.

2. Decode the instruction and read registers.

3. Perform an ALU operation.

4. Read/write memory data if the instruction involves a memory operand.

5. Write the result into the destination register, if needed.





Comments

Post a Comment

Popular posts from this blog

Lecture 11 Linux Network and Process Management

-
Image
  Process In Linux, a process is a currently executing program, representing an instance of a program managed by the Linux kernel. Every process is distinguished by a specific Process ID (PID) and possesses its own allocated resources, including memory and CPU time. Process States Process States in a System: Running : Actively executing code. Ready : Awaiting CPU time to run. Sleeping : Paused, pending an event or resource. Stopped : Halted intentionally by user or the system. Zombie : Process finished, but still listed in the process table. Process Management Commands for Managing Processes in Linux: ps : Displays a snapshot of the current processes.             Example: ps ps  aux: Shows detailed information about all processes.             Example: ps aux ps aux | grep username : Filters processes by a specific username.             Example:...
Read more

Lecture 12 Clint Server Architecture

-
Image
  Introduction The client-server architecture is a framework for computer networks where numerous clients, acting as remote processors, seek and obtain services from a central server or host computer.  Clients serve as interfaces, enabling computer users to solicit services from the server and showcase the outcomes returned by the server. Servers, in turn, anticipate incoming requests from clients and subsequently fulfill them with appropriate responses. Client  – The client can be any computer that requests something from the server. For example – visiting any website we request the webpage from its domain. So here we act as a client. Server  – On the other hand, the Server is the computer that is designed to serve the requests to the client. For the same example as above, the client asks for the webpage then the server responds with the webpage to the client. Working of Client-Server Architecture when a client seeks data from a server, it initiates the process by q...
Read more