Introduction To Computer Architecture
Introduction To Computer Architecture
Introduction To Computer Architecture
Computer Architecture
Steven Swanson
Andiry Xu
Qi Li
Todays Agenda
What is architecture?
Why is it important?
Whats in this class?
Computer Architecture
What is architecture?
How do you build a machine that computes?
For you
Orientation
The internet
U ltra P ortable
H andheld
Architecturally, these
machines are more similar
than different
Same parts
Different Scale
Different Constraints
Memory
Memory
Memory
PCIe
Memory
Orientation: A Server
Memory
Memory
Memory
Memory
CPU Sockets
Connectors
System
Hub
CPU
SSD Slot
Memory
Orientation: iPhone 4s
Flash Memory
on the back
Peripheral
s
Sim
Card
CPU +
DRAM
Nehalem Corei7
Quad-core Server
processor
Nvidia Tegra 3
Five-core mobile
processor
15
P hysics/M aterials
D evices
This C ourse
M icro-architecture P rocessors
A rchitectures
16
cse131
cse130 cseEverythingElse
JVM
Processor
Architectures
Abstraction
Compilers
Languages
Software
Engineers/Applicatio
ns
Current state of
architecture
Moores Law
The number of transistors we can build in a fixed area
of silicon doubles (roughly) every two years.
20
Since 1940
50,000 x speedup
>1,000,000,000 x density
(Moores Law)
100000
specINT95 Perf
specINT2000 Perf
specINT2006 Perf
specINT2000 Mhz
specINT2006 Mhz
10000
Clock speed
1000
100
Golden age:
~40-50%/year
10
1
1990
Modern era:
~25%/year
1995
2000
2005
2010
2015
Year
22
23
24
25
Multi-processors
Intel P4
(2000)
1 core
Intel Nahalem
(2010)
4 cores
SPARC T3
(2010)
16 cores
Nvidia Tegra 3
(2011)
5 cores
AMD Zambezi
(2011)
16 cores
29
30
31
32
Instruction sets
MIPS
x86
ISAs and the compiler
Basic design
Pipelining
Dealing with hazards
Speculation and control
Memory technologies
Caching
Operating system
support
Virtual memory
Exceptions, interrupts
IO
Introduction to
multiprocessors
Measuring performance
Amdahls Law
Performance measurement
Metrics
cd demos/
make
java -server -Xmx$[1024*1024*1024] -Xmx$[1024*1024*1024] LoopNest 1000 ij
java -server -Xmx$[1024*1024*1024] -Xmx$[1024*1024*1024] LoopNest 1000 ji
34
cse141 Logistics
35
Course Staff
Instructor:
Steven
Swanson
http://cseweb.ucsd.edu/classes
/sp14/cse141-a/
36
Academic Honesty
Dont cheat.
37
Course Structure
38
Conventional Lectures
Traditional class structures often look like:
Lecture
First
Exposure
Textbook
Homework
Exam
See if You
Show Knowledge
Know Hard Stuff
Mastery
Homework
Lab
Exam
Q
U
I
Z
First Exposure:
With resources and
Feedback
Better structure
Practice
Show Knowledge
Knowledge
Mastery
Mastery
Science to Back it Up
Crouch, C., Mazur, E. Peer Instruction: Ten years of experience and results
Traditional Instruction
Peer Instruction
41
Science to Back it Up
Everyone constructs their own understanding
I cant dump understanding into your brain
To learn YOU must actively work with a
problem and construct your own
understanding of it
Upper
Division
Math-Based
Computing
Upper
Division
Computin
g
Valuable for my
learning
91%
80%
79%
Recommend
other instructors
use
87%
91%
90%
Your Tasks
Come to class!
Homeworks
Assigned on Thursday, due one week later
Partly from the book.
These are the best way to prepare for the
tests.
Due in a TAs box, 15 minutes before class
starts.
47
Peer instruction
Ill bring in activities to ENGAGE you in exploring your understanding
of the material
Let you practice
Bring out misconceptions
Let us LEARN from each other about difficult parts.
You will be GET CREDIT for your efforts to learn in class
By answering questions with a clicker (iClicker)
Answer 80% of the clicker questions in class, get 10% of your
final grade
Process: Individual Answer, Group Discussion, Group Answer
Register your i-clicker
Grading
Grading is on a 13 point scale -- F through A+
50