computer architecturefall 2007 © august 27 th, 2007 introduction to computer architecture lecture...
TRANSCRIPT
Computer Architecture Fall 2007 ©
August 27th, 2007
www.qatar.cmu.edu
Introduction to Computer Architecture
Lecture 1 – Introduction
Computer Architecture Fall 2007 ©
Teaching Staff
• Instructors- Prof. Majd F. Sakr
- Prof. Karem A. Sakallah
• TA- Zaher Andraus
Computer Architecture Fall 2007 ©
Where Do We Find a Computer/Processor?
Cell phones
ATMs
Medical (MRI)
Cars
Microwave
TrafficController
ipod PDA
Planes
Watch
Robots
Cameras
MusicDesign &Engineering
Games
Computer Architecture Fall 2007 ©
Why Did We Develop Computers?
Problem
Solution
Implementation
Computer
Result
A solution to a problem!
While thinking of a solution,think about:
• Cost $$$
• Speed
• Energy/Power
• Size
• Efficiency
• etc…
Computer Architecture Fall 2007 ©
Types of Computers
°Personal Computer
°Workstation
°Server
°Supercomputer
°Embedded
Computer Architecture Fall 2007 ©
290
933
488
1143
892
1354
862
1294
1122
1315
0
200
400
600
800
1000
1200M
illi
on
s o
f C
om
pu
ters
1998 1999 2000 2001 2002
Embedded
Desktops
Servers
Number of Computers Sold
Computer Architecture Fall 2007 ©
Computer Architecture
Problem
Solution
Implementation
Computer
Result
Compiler
Our Area of Focus
Our Area of Understanding
Computer Architecture Fall 2007 ©
Architecture
Where is “Computer Architecture and Engineering”?
*Coordination of many levels of abstraction
I/O systemProcessor
CompilerOperating
System(Windows XP)
Application (MediaPlayer)
Digital DesignCircuit Design
Instruction Set Architecture
Datapath & Control
transistors
MemoryHardware
Software Assembler
Computer Architecture Fall 2007 ©
Anatomy: 5 components of any Computer
Personal Computer
Processor
Computer
Control(“brain”)
Datapath(“work”)
Memory
(where programs& data live whenrunning)
Devices
Input
Output
Keyboard, Mouse
Display, Printer
Disk (where programs & data live whennot running)
Computer Architecture Fall 2007 ©
Computer Technology - Dramatic Change!°Processor
• 2X in speed every 1.5 years (since ‘85); 100X performance increase in last decade.
°Memory• DRAM capacity: 2x / 2 years (since ‘96); 64x size improvement in last decade.
°Disk• Capacity: 2X / 1 year (since ‘97)
• 250X size increase in last decade.
Computer Architecture Fall 2007 ©
Tech. Trends: Microprocessor Complexity
2 * transistors/Chip Every 1.5 to 2.0 yearsCalled “Moore’s Law”
Computer Architecture Fall 2007 ©
Architecture & Organization
°Computer Architecture• What the “low level” programmer sees
- Types of Instructions
- Number of Registers
- Types of Operations
°Computer Organization• How the designer Implements the Design
- Layout
- Interconnection (wires)
Computer Architecture Fall 2007 ©
Computer Architecture and Organization
I/O systemProcessor
CompilerOperating
System(Windows XP)
Application (MediaPlayer)
Digital DesignCircuit Design
Instruction Set Architecture
Datapath & Control
Transistors
MemoryHardware
Software Assembler
Layout & Technology
Organization
Architecture
Computer Architecture Fall 2007 ©
Architecture & Organization 1
° Architecture is those attributes visible to the programmer
• Instruction set, number of bits used for data representation, I/O mechanisms, addressing techniques.
• e.g. Is there a multiply instruction?
° Organization is how features are implemented• Control signals, interfaces, memory technology.
• e.g. Is there a hardware multiply unit or is it done by repeated addition?
Computer Architecture Fall 2007 ©
Architecture & Organization 2
°All Intel x86 family share the same basic architecture
°The IBM System/370 family share the same basic architecture
°This gives code compatibility• At least backwards
°Organization might highly differ between different versions
Computer Architecture Fall 2007 ©
Course Path
Computer Architecture Fall ‘07
3 4 -b it A L U
LO register(16x2 bits)
Load
HI
Cle
arH
I
Loa
dLO
M ultiplicandRegister
S h iftA ll
L oad M p
Extra
2 b
its
3 23 2
L O [1 :0 ]
Result[H I] Result[LO]
3 2 3 2
Prev
LO
[1]
Booth
Encod
er E N C [0 ]
E N C [2 ]
C on tro lL og ic
InputM ultiplier
3 2
S u b /A d d
2
3 4
3 4
3 2
InputM ultiplicand
32=>34sig nEx
3 4
34x2 M U X
32=>34sig nEx
<<13 4
E N C [1 ]
M u lti x2 /x1
2
2HI register(16x2 bits)
2
01
3 4 Arithmetic
Memory Systems
I/O
YOUR
CPU
µProc60%/yr.(2X/1.5yr)
DRAM9%/yr.(2X/10 yrs)
1
10
100
1000
198
0 198
1 198
3 198
4 198
5 198
6 198
7 198
8 198
9 199
0 199
1 199
2 199
3 199
4 199
5 199
6 199
7 199
8 199
9 200
0
DRAM
CPU
198
2
Processor-MemoryPerformance Gap:(grows 50% / year)
Time
“Moore’s Law”
Performance
Datapaths &
Control
opcode rs rt offset
rd functshamtopcode rs rt
opcode rs rt immediate
rd functshamtopcode
rs rt
rd functshamtopcode rs rt
Instruction Sets
Computer Architecture Fall 2007 ©
Homeworks and Projects
°Quizzes (weekly)
°Assignment (every ~2 weeks)
°Project (every ~3-4 weeks)
°End of Semester Project: • Demo • Oral Presentation • Head-to-head Race• Final Report
Computer Architecture Fall 2007 ©
Course Exams
°Reduce the pressure of taking exams• Exam I
• Exam II
• Final
°Goal• Our goal: test knowledge vs. speed writing(no memorization)
• Review meetings: before?
Computer Architecture Fall 2007 ©
Grading°Grade breakdown• Exam I: 10%
• Exam II: 10%
• Final: 20%
• Projects 30%
• Homeworks/Quizes 10%
• Attendance/Participation: 5%
°No late homeworks or projects!
°Written request for changes to grades
Computer Architecture Fall 2007 ©
Our Goals
° Show you how to understand modern computer architecture in its rapidly changing form
° Show you how to design by leading you through the process on challenging design problems and by examining real designs
° Learn application analysis and new design techniques
Computer Architecture Fall 2007 ©
Text
° Required: Computer Organization and Design, 3rd Edition, Patterson and Hennessy (COD)
° Reference: Computer Organizationand Architecture, 6thEdition, William Stallings
• Readings on web pagehttp://williamstallings.com/COA6e.html
° Reference: Structured Computer Organization, 4th Edition, Andrew S. Tanenbaum
Computer Architecture Fall 2007 ©
The Big Picture
Computer Architecture Fall 2007 ©
Types of Processors
Computer Architecture Fall 2007 ©
Hardware/Software Divide
Hardware
System Software
Application
ExcelInternet Explorer
Visual Studio
Windows XPLinux
SolarisOS X
PCMACSUN
Computer Architecture Fall 2007 ©
Compiler
Assembler
Program Path to Execution
High Level Language Program (.c file)
Assembly Language Program (.asm file)
Binary Machine Language Program (.exe file)
Computer Architecture Fall 2007 ©
The Five Components of a Computer
Computer Architecture Fall 2007 ©
The Motherboard:
ALU &
CU
Input&
Output
M
The five von Neumann components:
Computer Architecture Fall 2007 ©
Motherboard
Computer Architecture Fall 2007 ©
Inside the Processor
Computer Architecture Fall 2007 ©
Manufacturing Process
Computer Architecture Fall 2007 ©
An 8-inch (200-mm) Diameter Wafer
Computer Architecture Fall 2007 ©
Computer’s History 1st generation: Vacuum Tubes
°During World War 2 the Army’s Ballistics Research Laboratory employed more than 200 people to solve essential ballistics equations using desktop calculators.
Computer Architecture Fall 2007 ©
1st generation: Vacuum Tubes
Professor Mauchly (EE) & his gradate student Eckert proposed to build a general purpose computer using vacuum tubes for the Ballistics Research Laboratory (BRL)
Computer Architecture Fall 2007 ©
ENIAC (Electronic Numerical Integrator And Computer)° ENIAC built in World War II was the first general purpose computer
• Used for computing artillery firing tables
• 24 meters long by 2.5 meters high and several meters wide
• Each of the twenty 10 digit registers was 1 meter long
–Since then:
Moore’s Law:
transistor capacity doubles every 18-24 months
Computer Architecture Fall 2007 ©
1st generation: ENIAC Completed in 1946
° Decimal (not binary)
° 20 accumulators of 10 digits
° Programmed manually by switches & cables
° 18,000 vacuum tubes
° 30 tons
° 15,000 square feet
° 140 kW power consumption
° 5,000 additions per second
Programming the ENIAC
1 2 34
56
87
90
Computer Architecture Fall 2007 ©
The von Neuman machine - Completed 1952
°Stored Program concept
°Main memory storing programs and data
°ALU operating on binary data
°Control unit interpreting instructions from memory and executing
° Input and Output equipment operated by control unit
Scientist at the Institute of Advanced Studies
Computer Architecture Fall 2007 ©
Structure of von Neumann Machine
Main Memory
Input/Output Equipment
Arithmetic –Logic Unit
Program Control Unit
Central Processing Unit CPU
CC
CA
MI/O
R
Computer Architecture Fall 2007 ©
Commercial Computers
° 1947 - Eckert-Mauchly Computer Corporation
° 1st successful machine: UNIVAC I (Universal Automatic Computer)
° Commissioned by the US Bureau of Census for the 1950 calculations
° Became part of Sperry-Rand Corporation
° Late 1950s - UNIVAC II• Faster
• More memory
• Upward Compatibility
Computer Architecture Fall 2007 ©
2nd Generation: Transistors
°Replaced vacuum tubes
°Smaller & Cheaper
°Less heat dissipation
°Solid State device (silicon)
° Invented 1947 at Bell Labs
The First Transistor
Computer Architecture Fall 2007 ©
Transistor Based Computers
°Second generation machines
°NCR & RCA produced small transistor machines
° IBM 7000
°DEC - 1957• Produced PDP-1
Computer Architecture Fall 2007 ©
Microelectronics
°Literally - “small electronics”
°A computer is made up of gates, memory cells and interconnections
°These can be manufactured on a semiconductor
°e.g. silicon wafer
Computer Architecture Fall 2007 ©
Growth in CPU Transistor Count
Computer Architecture Fall 2007 ©
Moore’s Law
° Increased density of components on chip
° Gordon Moore - cofounder of Intel
° Number of transistors on a chip will double every year
° Since 1970’s development has slowed a little• Number of transistors doubles every 18 months
° Cost of a chip has remained almost unchanged
Computer Architecture Fall 2007 ©
Moore’s Law - Cont’d
° Higher packing density means shorter electrical paths, giving higher performance
° Smaller size gives increased flexibility
° Reduced power and cooling requirements
° Fewer interconnections increases reliability
Computer Architecture Fall 2007 ©
Computer Generations
Generation Dates Technology Operations per Second
1 1946-1957 Vacuum Tube 40,000
2 1958-1964 Transistor 200,000
3 1965-1971 Small & Medium Scale Integration
1,000,000
4 1972-1977 Large Scale Integration (LSI)
10,000,000
5 1978-… Very Large Scale Integration (VLSI)
100,000,000
Computer Architecture Fall 2007 ©
And in conclusion...°Continued rapid improvement in Computing
• 2X every 1.5 years in processor speed; every 2.0 years in memory size; every 1.0 year in disk capacity; Moore’s Law enables processor, memory (2X transistors/chip/ ~1.5 ro 2.0 yrs)
°5 classic components of all computers Control Datapath Memory Input Output}
Processor