Table of Contents
Chapter 1
Introduction
What is a computer?
Abstraction
Instruction Set Architecture
Where we are headed
Chapter 2
Performance
PPT Slide
Computer Performance: TIME, TIME, TIME
Execution Time
Book's Definition of Performance
Clock Cycles
How to Improve Performance
How many cycles are required for a program?
Different numbers of cycles for different instructions
Example
Now that we understand cycles
Performance
CPI Example
# of Instructions Example
MIPS example
Benchmarks
SPEC ‘89
SPEC ‘95
SPEC ‘95
Amdahl's Law
Example
Remember
Chapter 3
Instructions:
MIPS arithmetic
MIPS arithmetic
Registers vs. Memory
Memory Organization
Memory Organization
Instructions
Our First Example
So far we’ve learned:
Machine Language
Machine Language
Stored Program Concept
Control
Control
So far:
Control Flow
Policy of Use Conventions
Constants
How about larger constants?
Assembly Language vs. Machine Language
Other Issues
Overview of MIPS
Addresses in Branches and Jumps
Addresses in Branches
To summarize:
PPT Slide
Alternative Architectures
PowerPC
80x86
A dominant architecture: 80x86
Summary
Chapter Four
Arithmetic
Numbers
Possible Representations
MIPS
Two's Complement Operations
Addition & Subtraction
Detecting Overflow
Effects of Overflow
Review: Boolean Algebra & Gates
An ALU (arithmetic logic unit)
Review: The Multiplexor
Different Implementations
Building a 32 bit ALU
What about subtraction (a – b) ?
Tailoring the ALU to the MIPS
Supporting slt
PPT Slide
Test for equality
Conclusion
Problem: ripple carry adder is slow
Carry-lookahead adder
Use principle to build bigger adders
Multiplication
Multiplication: Implementation
Second Version
Final Version
Floating Point (a brief look)
IEEE 754 floating-point standard
Floating Point Complexities
Chapter Four Summary
|