0% found this document useful (0 votes)
8 views12 pages

Computer Architecture Basics Explained

Uploaded by

adrianniel.garig
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
8 views12 pages

Computer Architecture Basics Explained

Uploaded by

adrianniel.garig
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

Name: Niel Adrian B.

Garig Program & Section: BSCS-1A Course: Computer Architecture &


Organization

Computer Architecture
INTRODUCTION TO COMPUTER ORGANIZATION & ARCHITECTURE –
and Organization
VIDEO 1

Basic illustration for describing


Architecture and Organization

 Similarly, when creating a machine or


device, to achieve the goal; first, we build the structure of it and once you make
a plan, we will try to organize our resources to achieve the final product.
 Example: In order to create a machine or device, we need to determine the
structure. See the photo below.

This means that Architecture and Organization are systematic


approach of deriving the solution of any problems.

 Deals with  Deals with


functional structural
behavior of relationship.
Computer Systems.  Operational
Attributes are
 Design linked together
 A generate computer is comprise
of various functional units, among
them is the Processor – which is
the most important one.

 Next, we have the Memory. It


stores all the instructions that the
processor reads it accordingly.
We can also store data inside the
Memory.

 I/O Peripherals is another


functional unit also known as
devices.

 All of these are very essential


when computation in computers
is concern.
 The programs or the set-up instructions are stored into the memory using input
devices, so that the processor can execute them. During execution, the required
inputs can either be pair into the system using the same input peripherals or
stored into the memory beforehand. Finally, the outputs can be generated into
the output devices or else can be stored into the memory for later use.
 The intercommunication of all these functional components is carried out with
the help of the System Bus.

Syllabus
 Basic and classifications of Computer Architecture
 Memory interfacing and Hierarchy
 Computer Organization
 I/O Interfacing
 Instruction Pipelining
 Number System

Name: Niel Adrian B. Garig Program & Section: BSCS-1A Course: Computer Architecture &
Organization

Computer Architecture
and Organization
BASICS OF COMPUTER ARCHITECTURE – VIDEO 2
What is Computer Architecture?
 Computer Architecture is the design of computers, including their instruction
sets, hardware components and system organization.

ARCHITECTUR
E

Instruction Set Architecture Hardware System


(ISA) Architecture
 Include specifications but (HSA)
determine how machine  Deals with the computers’
language programs will major hardware subsystems
interact with the computer. like CPU, Storage, I/O Devices,
etc.
 It includes both the logical
design and the data flow
organization and hence
determines the efficiency.

HISTORY
1. Analytical Engine – It was the first propose mechanical general purpose
computer design by Charles Babbage (the great computer pioneer) and was
assisted by Ada Lovelace (the first one to come up with the basic idea of
having a language in order to operare the proposed machine).

The advent of Computability and Non-computability

Alan Turing Not everything is


computable!!!
Haven’t you heard about the
computability and non-
computability?
 Alan Turing figured out that problems can be solved using computers. He is
widely considered as the Father of Computer Science. Alongside Turing,
there is another man which is very associated with computation – Johann Von
Neumann.
Johann Von
Neumann He can divide an 8-digit number
by another 8-digit number within
just a fraction of second when he
was just 6 years old.

The great mathematician who


grabbed the full-time professor
position at Princeton University by
the age of 30.

David Brailsford
He is from the University of
Nottingham in UK. He has been
teaching computer science for
more than 50 years

Name: Niel Adrian B. Garig Program & Section: BSCS-1A Course: Computer Architecture &
Organization

Computer Architecture
and Organization
Classifications of Computer Architecture – VIDEO 3

COMPUTER
ARCHITECTURE

Von Neumann Architecture Non-Von Neumann


A.K.A. Princeton Architecture Architecture
Harvard
Architecture

Modified Harvard Architecture

CLASSIFIACTION OF COMPUTER ARCHITECTURE


1. SISD (Single Instruction stream, Single Data stream) - A single processor
executes one instruction at a time on one data set. This is the typical operation
of a basic, sequential computer.

2. SIMD (Single Instruction stream, Multiple Data stream) - One instruction is


executed on multiple data points simultaneously, making it ideal for tasks like
image processing and scientific computations that involve large sets of data.

3. MISD (Multiple instruction stream, Single data stream) - Multiple processors


execute different instructions on the same data set. This architecture is rare and
is used in specialized applications such as fault-tolerant systems.
4. MIMD (Multiple instruction stream, Multiple data stream) - Multiple processors
perform different instructions on different data sets concurrently, commonly
used in multicore processors and distributed computing systems.

Name: Niel Adrian B. Garig Program & Section: BSCS-1A Course: Computer Architecture &
Organization

Computer Architecture
and Organization
Introduction to Memory – VIDEO 4

What is Memory?
 Memory is the faculty of the brain by which data or information is encoded,
stored, and retrieved when needed.

 With the increasing size of the Memory, the time to access them gets
increased, and time is the essence.
How fast are the processor nowadays?
 Suppose that you have 2GHz processor on your phone, to calculate this, see the
photo below.

 Computer designers tend to perform a medium task as


Primary Memory.

 And the memory which is used as a


Permanent storage is known as
Secondary Memory.

OTHER MEMORY STORAGE:


1. Dynamic Random Access Memory (DRAM) - is a type of volatile memory that
stores data in capacitors. It requires periodic refreshing to maintain data
integrity, as the stored charge can leak over time. DRAM is commonly used as
the main memory in computers and devices due to its balance of speed,
capacity, and cost.

2. Static Random Access Memory (SRAM) -


is a type of volatile memory that uses bistable
latching circuitry to store each bit of data. Unlike DRAM, SRAM does not require
periodic refreshing to maintain data, making it faster and more reliable.
However, SRAM is more expensive and less dense than DRAM, which limits its
use primarily to cache memory in processors and other high-speed applications.

SECONDARY MEMORY ARE:


 Slower than Primary Memory
 Retains Data Permanently
 Bigger in size
 Cost-effective
 Semi-Random accessibility

Here is an illustration/example:
Name: Niel Adrian B. Garig Program & Section: BSCS-1A Course: Computer Architecture &
Organization

Computer Architecture
and Organization
Memory Hierarchy & Interfacing – VIDEO 5

Acces Size Cost Usage


s Time Frequency

Memory Interfacing
 Parts of Computer Organization
 Deals with the way of connecting various level of Memory units to processor &
I/O Peripherals.

UNITS OF MEASURING SPEED: MIPS (Million Instruction Per Second)


1. WAY 1 – All the different memory
levels are simultaneously connected
to the processor. the processor wants
some information, it can look for it in
all different Whenever levels side by
side. Here, the processor is connected
to a 3-memory unit of different levels.

Access Time
Calculate Hit
ratio

FORMULA: EFFECTIVE/AVERAGE MEMORY ACCESS TIME (T avg)

2. WAY 2 – Here the processor is not


simultaneously connected to all the
memory unit.

FORMULA: EFFECTIVE/AVERAGE MEMORY ACCESS TIME (T avg)

Common questions

Powered by AI

DRAM (Dynamic Random Access Memory) and SRAM (Static Random Access Memory) differ primarily in their storage mechanisms and applications. DRAM stores data in capacitors, which require periodic refreshing to retain data, making it slower but more cost-effective and higher in density compared to SRAM. Consequently, DRAM is commonly used as the main memory in computers where larger volumes of memory are needed. Meanwhile, SRAM uses bistable latching circuitry, providing faster access times without needing refresh cycles, making it more reliable but also more expensive and less dense than DRAM. Due to its speed, SRAM is generally used in cache memory for processors to store frequently accessed data and instructions .

Instruction pipelining enhances processor performance by overlapping instruction execution, dividing the processing task into distinct steps that are processed in parallel across various pipeline stages. This concurrency allows for higher throughput and better utilization of the CPU, as more instructions are processed in a given time compared to a non-pipelined architecture. However, it presents limitations such as pipeline hazards, including data, control, and structural hazards, which can stall the pipeline and reduce its efficiency. Handling these hazards requires complex scheduling and hazard resolution mechanisms, potentially adding overhead and complexity to the CPU design .

SISD (Single Instruction stream, Single Data stream) is suitable for sequential computer operations, where a single processor executes one instruction at a time on one data set, making it ideal for simple, linear processes. SIMD (Single Instruction stream, Multiple Data stream), on the other hand, is designed for concurrent operations on multiple data points with a single instruction, making it valuable for applications like image processing and scientific computations. MISD (Multiple Instruction stream, Single Data stream) is rare but useful in specialized applications such as fault-tolerant systems, where different operations are performed on the same data set to ensure reliability. MIMD (Multiple Instruction stream, Multiple Data stream) enables multiple processors to perform different instructions on different data sets concurrently, suiting multicore processors and distributed systems for tasks requiring parallel computation and high throughput .

The structure of computer hardware involves the organization of the system's physical components such as the CPU, memory, and I/O devices, which are essential in executing computations. The design of these elements needs to work seamlessly with software, which includes the instruction sets and the logic that controls the hardware operations. This interplay influences the overall efficiency because the architecture defines how efficiently the hardware implements the software instructions through data flow organization and logical design. The coordination between hardware’s structural relationship and software's functional behavior is requisite to ensure high performance in terms of speed and resource utilization .

Evaluating computer systems based on their instruction set architecture (ISA) is essential because the ISA acts as the interface between software and hardware, directly influencing system performance, efficiency, and compatibility. Factors to consider in this evaluation include the complexity and variety of instructions, instruction format, addressing modes, and how these attributes translate to execution efficiency. Additionally, the balance between hardware simplicity and the necessity for rich instruction sets impacts the cost and speed of development and execution. The ISA also determines how well a system can adapt to new software requirements or integrate with future hardware technologies .

The Harvard architecture distinguishes between instructions and data by using separate memory spaces for them, allowing simultaneous access to both, which increases throughput since instructions and data can be fetched in parallel. The Modified Harvard architecture retains this separation while allowing some data and instruction memory to be accessed from both spaces, offering flexibility and a balanced approach to managing memory access. This is particularly beneficial for performance in processors that require high-speed memory access, like those used in signal processing. These architectures address the limitations of the Von Neumann architecture by reducing the bottlenecks associated with shared medium for data and instruction transfer .

The concept of non-computability, identified by early pioneers like Alan Turing, remains relevant in contemporary computer science and architecture as it underlines the limitations of what can be solved using algorithmic processes. In theory and practice, it draws attention to problems that no algorithm can solve, guiding the boundaries of computing capabilities. This concept informs the development of computational models and algorithms, ensuring that design and resources are directed toward solvable problems and feasible applications. It also plays a pivotal role in theoretical computer science, influencing areas such as complexity theory and the exploration of alternative computing paradigms like quantum computing, which seek to address certain non-computable problems .

Memory hierarchy is critical in modern computing systems as it organizes storage in various levels that differ in speed, size, and cost, enabling efficient data access and storage management. The hierarchy includes registers, cache, primary memory (RAM), and secondary storage (hard drives). Each level is designed to store data closer to the processor according to the frequency of access, ensuring quick retrieval for commonly used data, and thus reducing the bottleneck created by slower storage. This hierarchy allows systems to leverage faster memory types when needed while utilizing larger storage capacities efficiently without incurring high costs, ultimately enhancing the overall performance and speed of computing systems .

Alan Turing significantly contributed by figuring out that problems can be solved using computers, which laid the groundwork for theoretical computer science and algorithms. His work introduced the concept of a universal machine, which became a cornerstone for computing theory. Johann Von Neumann further developed these concepts by formalizing the architecture of computer systems, known as the Von Neumann Architecture, which outlines the structure of most contemporary computers. This architecture includes the idea of storing program instructions in memory, distinguishing it from earlier machine designs. Together, they bridged theoretical insights and practical implementation, shaping modern computing systems .

Memory interfacing involves connecting various levels of memory units to the processor and I/O peripherals, ensuring efficient data transfer and processing. The main role of memory interfacing is to facilitate communication between the processor and memory units, predicting data storage needs and optimizing access times to improve system performance. Challenges in memory interfacing include matching speed and bandwidth between different memory components, minimizing latency, and balancing cost against speed and capacity. Proper interfacing is crucial to prevent bottlenecks and ensures that faster components do not remain idle, thereby optimizing the overall functioning of computer systems .

You might also like