Professional Documents
Culture Documents
SPECIFIC OBJECTIVES:
At the end of the topic session, the students should be able to:
MATERIALS/EQUIPMENT:
o OHP
o File/s (01 Introduction to Computer Architecture)
• 01 Presentation
• 01 Laboratory Exercise
• 01 Handout
• 01 Quiz
TOPIC PREPARATION:
o Prepare the topic slides (36 pages) needed for the topic
presentation.
o Prepare additional examples on the sub-topics to be
presented.
PRESENTATION OVERVIEW:
A. Introduction 20 min
B. Instructional Input
Introduction to Computer Architecture 95 min
a. Explain the concepts of computer architecture
b. Discuss the history of computer architecture by tracing its
history
Cost Factor – Technology Trends 50 min
a. Dis
cuss the cost factor for computer systems
Performance Metrics 50 min
a. Des
cribe the performance metrics of a computer system
Memory Hierarchy 65 min
a. Dis
cuss the memory hierarchy of a computer system
C. Generalization 80 min
D. Application 180 min
Total duration 540 min
TOPIC PRESENTATION:
A. Introduction
expectations from the students and ask the students about their
expectations from the course.
2. Then, ask the students if they have any idea on how a computer
motherboard was built. Acknowledge their answers.
3. After that, tell the students that they will learn how engineers are
able to integrate the different parts of a computer system to come
up with one operational computer system. Tell your students that
this course will be about the basic computer architecture system
and how these systems interact with each other.
B. Instructional Input
Slide 2 2. Show Slides 2 to 15. Introduce and discuss the basic concepts a
computer architecture
Introduction to Computer
Architecture
Computer Architecture Computer Architecture
It is a coordination of many levels of abstraction under
a rapidly changing set of forces and is used to design,
measure, and evaluate computer systems.
Computer architecture is a coordination of many levels of
abstraction under a rapidly changing set of forces and is
used to design, measure, and evaluate computer systems.
Slide 6
Introduction to Computer Examples (versions) Introduced in
Architecture
Intel (8086, 80386, Pentium, 1978
Examples (versions) Introduced in
Instruction Categories
Load/Store
Floating Point and Memory Management.
Integer Arithmetic
Jump and Branch
Floating Point
Memory Management
Slide 8
Introduction to Computer
Architecture
Registers
R-
Op6 Rs5 Rt5 Rd5 sa5 funct6
type R0 - R31
I-
Op6 Rs5 Rt5 immediate16
type
J- PC
Op6 immediate26
type HI
LO
a)
b)
Figure 1.2 Instruction Categories
Computer Arithmetic
1943
Charles Babbage
British government
Analytical
Engine
COLLOSSUS
First programmed computer
(mechanical)
First electronic computer
Babagge (mechanical)
1944
1946
Howard Aiken
ENIAC I
Electromagnetic relays
1978
IBM
DEC
System/360
VAX
Integrated circuits, first “family” of
computers
First 32-bit superminicomputer
Neumann Neumann architecture)
1981 IBM IBM PC Started personal computer era
1992 DEC Alpha First 64-bit personal computer 1960s Ken PDP -1 and Transistors,
Olson PDP-8 minicomputer
(Dec)
Slide 14
Introduction to Computer
Architecture
Cost Factors Affecting ISA
Technology
Programming
Languages
Applications
Computer Cleverness
Architecture
Operating
Systems
History
Figure 1.3 show the cost factors affecting ISA that are
essential in understanding computer systems architecture.
There are several aspects that are needed to be taken into
consideration in the design of a computer system such as
the technology, programming language, applications that
are intended to be used by the system and the operating
system requirements. To be able to fully design or
improve the computer systems architectural design,
cleverness is very important. One should be familiar with
all the past improvements and history of the system so that
the design will be far better than the past and current
systems designs.
Slide 15
Introduction to Computer
Architecture
ISA: Critical Interface
software
instruction set
hardware
Processor
Input
Control
Memory
Datapath
Output
Output devices: Display, printer, …
Storage devices
1. Input devices: Keyboard, mouse, …
Volatile memory devices: DRAM, SRAM, …
Permanent storage devices: Magnetic, Optical, and
Flash disks, …
2. Output devices: Display, printer, …
4. Datapath
5. Control
Control
Newly added 6th component: Network
the computer to the network such as LAN or the internet.
Essential component for communication in any computer
system
Slide 19 1. Show Slide 19 to 25. Discuss the cost factors that affect the
technology trends of a computer system.
Cost Factor - Technology
Trends
Processor
The logic capacity increases about 30% per year and the
The following are the main factors that affect the
clock rate increases about 20% per year
Memory
performance of a computer system and the significant
DRAM capacity increases about 60% per year (4x every 3
years), the memory speed increases about 10% per year
and the cost per bit improves about 25% per year
changes that that are being made to improve these factors
Disk
The capacity increases about 60% per year and the total
use of data increases 100% per 9 months
Network Bandwidth
Bandwidth is increasing more than 100% per year
• Processor
The logic capacity increases about 30% per year and the
clock rate increases about 20% per year.
• Memory
• Disk
The capacity increases about 60% per year and the total
use of data increases 100% per 9 months.
• Network Bandwidth
Performance Metrics
Measuring Performance
Slide 28
To measure the performance of a computer system, you
Performance Metrics can use wall-clock time or the total Execution Time of a
Measuring Performance process. CPU Time can also be used to monitor the user
Wall-clock time –or- Total Execution Time
time and the system time so that you can track how long it
CPU Time
User Time takes for a process or task to be accomplished.
System Time
Performance Metrics
The performance of a computer system can be measured
as the inverse of the execution time. The following
Relating the Metrics
Performance = 1/Execution Time equations can be used in measuring the performance of a
CPU Execution Time = CPU clock cycles for program
x Clock cycle time computer system.
CPU clock cycles = Instructions for a program x
Average clock cycles per Instruction
Performance Metrics
The improvement of one aspect of a machine to increase
Amdahl’s Law its performance is proportional to the amount and size of
The improvement of one aspect of a machine to improvement
increase its performance is proportional to the amount
and size of improvement
Memory Hierarchy
Memory Hierarchy
Memory Hierarchy
Registers
Slide 33
Registers are temporary storage containers used inside
Memory Hierarchy the CPU. They are extremely fast, fixed size, usually
Registers multiples of 8-bits. They are also called a “word”. One
temporary storage containers used inside the CPU
extremely fast, fixed size, usually multiples of 8-bits example is the 32-bit machines (4-byte words).
also called a “word”
example is the 32-bit machines (4-byte words)
Memory Hierarchy
What if a program is too big for RAM? If a program is too
big for memory (RAM), then we start using the hard drive
Virtual Memory
What if a program is too big for RAM? (disk) to store data. The portion of the hard drive that can
If a program is too big for memory (RAM):
start using the hard drive (disk) to store data
The portion of the hard drive that can be used to increase
be used to increase the RAM capacity is referred to as the
the RAM capacity is referred to as the virtual memory
virtual memory. In effect, big programs can be stored in
the RAM and the virtual memory as if the RAM capacity
becomes bigger.
Slide 35 Cache
Memory Hierarchy
The characteristics of a cache memory are the following:
Cache
Characteristics of a cache memory
Slower than registers • Slower than registers
Faster than RAM
Located in front of main RAM
•
Different levels of cache
Level1 (L1) and Level2 (L2)
Size is usually around 1 MB
Faster than RAM
Slide 36
Memory Hierarchy
Hard Drives
Slide 37
Memory Hierarchy
Hard Drives
Slide 38 CD/DVDs
Memory Hierarchy
CDs and DVDs have lands and pits used to represent
binary information. They use optical medium such as
CD/DVDs
Lands and pits used to represent binary lasers and refraction of light to read lands and pits.
Optical medium - lasers and refraction used to read
lands and pits
Memory Hierarchy
Direct access is also known as “random access”. There is
no need to go through other data to get the data you want.
Direct Access
also known as “random access” It like “magic data retrieval” because there is no
no need to go through other data to get the data you
want movement/motion needed to get the data. Examples are
like “magic data retrieval” because there is no
movement/motion to get the data
Examples are registers, cache and RAM
registers, cache and RAM.
Sequential Access
Slide 40
Sequential access is also known as “serial-access”. The
Memory Hierarchy data is ordered in some sequential fashion, meaning, to
get to your data, you need to go through other data in front
Sequential Access
also known as “serial-access” of it.
data is ordered in some sequential fashion, meaning,
to get to your data, you need to go through other data
in front of it
Example is fast-forwarding through a tape to get to the
song you want
Example is fast-forwarding through a tape to get to the
song you want.
Memory Hierarchy
Direct-Access is a fast access. One disadvantage of direct
Direct-Access vs. Sequential Access
Direct-Access:
access is that the data cannot be accessed in sequential
Advantage: fast access
Disadvantage: data cannot be accessed in sequential or sorted
order
or sorted order. The data is placed randomly on the disk
Data is placed randomly on the disk
Accessing things in order then requires an index file
Slower when trying to access sequential data that is not already
and accessing things in order then requires an index file.
in order (back-and-forth-and-back-and-forth)
Example: hard drives (disks)
Sequential Access
It is slower when trying to access sequential data that is
Advantage: Simple to organize (already in some sequential order)
Disadvantage: Slow when accessing specific things in no order
Example: magnetic tape backups
not already in order (back-and-forth-and-back-and-forth).
One example is the hard drives or the disk drives.
C. Generalization
c. Memory Hierarchy
2. Have a one hour quiz on you next session. Please check the
syllabus- outline for the schedule of the quiz. Ask your students to
answer the questions in 01 Quiz.
D. Application
REFERENCES:
Retrieved at http://www.mkp.com/cod2e.htm