MIPS Introduction

Computer Architecture
A Quantitative Approach, Fifth Edition
Chapter 1 Fundamentals of Quantitative Design and Analysis
Copyright 2012, Elsevier Inc. All rights reserved.
Introduction
Computer Technology
Performance improvements:
Improvements in semiconductor technology
Feature size, clock speed Enabled by HLL compilers, UNIX Lead to RISC architectures
Improvements in computer architectures

Together have enabled:

Lightweight computers Productivity-based managed/interpreted programming languages

Copyright 2012, Elsevier Inc. All rights reserved. 2
CISC (Complex Instruction Set Computers) RISK ( Reduced Instruction Set Computer
Introduction
Single Processor Performance

Move to multi-processor
RISC
Introduction
Current Trends in Architecture
Cannot continue to leverage Instruction-Level parallelism (ILP)
Single processor performance improvement ended in 2003
New models for performance:
Data-level parallelism (DLP) Thread-level parallelism (TLP) Request-level parallelism (RLP)
These require explicit restructuring of the application

Classes of Computers
Personal Mobile Device (PMD)

e.g. start phones, tablet computers Emphasis on energy efficiency and real-time Emphasis on price-performance Emphasis on availability, scalability, throughput Used for Software as a Service (SaaS) Emphasis on availability and price-performance Sub-class: Supercomputers, emphasis: floating-point performance and fast internal networks Emphasis: price
Desktop Computing
Servers
Clusters / Warehouse Scale Computers

Embedded Computers
Parallelism
Classes of parallelism in applications:

Data-Level Parallelism (DLP) Task-Level Parallelism (TLP)
Classes of architectural parallelism:

Instruction-Level Parallelism (ILP) Vector architectures/Graphic Processor Units (GPUs) Thread-Level Parallelism Request-Level Parallelism
Flynns Taxonomy
Single instruction stream, single data stream (SISD) Single instruction stream, multiple data streams (SIMD)

Vector architectures Multimedia extensions Graphics processor units
Multiple instruction streams, single data stream (MISD)
No commercial implementation
Multiple instruction streams, multiple data streams (MIMD)
Tightly-coupled MIMD Loosely-coupled MIMD

Defining Computer Architecture
Defining Computer Architecture
Old view of computer architecture:

Instruction Set Architecture (ISA) design i.e. decisions regarding:
registers, memory addressing, addressing modes, instruction operands, available operations, control flow instructions, instruction encoding
Real computer architecture:

Specific requirements of the target machine Design to maximize performance within constraints: cost, power, and availability Includes ISA, microarchitecture, hardware
Trends in Technology
Integrated circuit technology

Transistor density: 35%/year Die size: 10-20%/year Integration overall: 40-55%/year
DRAM capacity: 25-40%/year (slowing) Flash capacity: 50-60%/year
15-20X cheaper/bit than DRAM
Magnetic disk technology: 40%/year

15-25X cheaper/bit then Flash 300-500X cheaper/bit than DRAM
10
Bandwidth and Latency
Bandwidth or throughput

Total work done in a given time 10,000-25,000X improvement for processors 300-1200X improvement for memory and disks
Latency or response time

Time between start and completion of an event 30-80X improvement for processors 6-8X improvement for memory and disks
11
Bandwidth and Latency
Log-log plot of bandwidth and latency milestones

Transistors and Wires
Feature size
Minimum size of transistor or wire in x or y dimension 10 microns in 1971 to .032 microns in 2011 Transistor performance scales linearly
Wire delay does not improve with feature size!
Integration density scales quadratically
13
Trends in Power and Energy
Power and Energy
Problem: Get power in, get power out Thermal Design Power (TDP)
Characterizes sustained power consumption Used as target for power supply and cooling system Lower than peak power, higher than average power consumption
Clock rate can be reduced dynamically to limit power consumption Energy per task is often a better measurement
Dynamic Energy and Power
Dynamic energy

Transistor switch from 0 -> 1 or 1 -> 0 x Capacitive load x Voltage2
Dynamic power
x Capacitive load x Voltage2 x Frequency switched
Reducing clock rate reduces power, not energy
15
Power

Intel 80386 consumed ~ 2 W 3.3 GHz Intel Core i7 consumes 130 W Heat must be dissipated from 1.5 x 1.5 cm chip This is the limit of what can be cooled by air
16
Reducing Power
Techniques for reducing power:

Do nothing well Dynamic Voltage-Frequency Scaling Low power state for DRAM, disks Overclocking, turning off cores
17
Static Power
Static power consumption

Currentstatic x Voltage Scales with number of transistors To reduce: power gating
18
Trends in Cost
Trends in Cost
Cost driven down by learning curve
Yield
DRAM: price closely tracks cost

Microprocessors: price depends on volume
10% less for each doubling of volume
19
20
Trends in Cost
Integrated Circuit Cost
Integrated circuit
Bose-Einstein formula:
21
Dependability
Dependability
Module reliability

Mean time to failure (MTTF) Mean time to repair (MTTR) Mean time between failures (MTBF) = MTTF + MTTR Availability = MTTF / MTBF
22
Measuring Performance
Measuring Performance
Typical performance metrics:

Response time Throughput
Speedup of X relative to Y
Execution timeY / Execution timeX
Execution time
Wall clock time: includes all system overheads CPU time: only computation time
Benchmarks

Kernels (e.g. matrix multiply) Toy programs (e.g. sorting) Synthetic benchmarks (e.g. Dhrystone) Benchmark suites (e.g. SPEC06fp, TPC-C)
Principles
Principles of Computer Design
Take Advantage of Parallelism
e.g. multiple processors, disks, memory banks, pipelining, multiple functional units
Principle of Locality
Reuse of data and instructions
Focus on the Common Case
Amdahls Law
24
Principles
The Processor Performance Equation
25
Principles
Different instruction types having different CPIs
26
Capacity Access Time Cost
Levels of the Memory Hierarchy

Staging Xfer Unit
CPU Registers
100s Bytes 300 500 ps (0.3-0.5 ns)
Registers Instr. Operands L1 Cache Blocks L2 Cache Blocks Memory Pages Disk Files Tape
1/26/2014
Upper Level
prog./compiler 1-8 bytes cache cntl 32-64 bytes
faster
L1 and L2 Cache
10s-100s K Bytes ~1 ns - ~10 ns $1000s/ GByte
Main Memory
G Bytes 80ns- 200ns ~ $100/ GByte
cache cntl 64-128 bytes
Disk
OS 4K-8K bytes
10s T Bytes, 10 ms (10,000,000 ns) ~ $1 / GByte
user/operator Mbytes
Tape
Larger
infinite sec-min ~$1 / GByte
Lower Level
27
27
28
1) Taking Advantage of Parallelism

Increasing throughput of server computer via multiple processors or multiple disks Detailed HW design
Carry lookahead adders uses parallelism to speed up computing sums from linear to logarithmic in number of bits per operand Multiple memory banks searched in parallel in set-associative caches
Pipelining: overlap instruction execution to reduce the total time to complete an instruction sequence.
Not every instruction depends on immediate predecessor executing instructions completely/partially in parallel possible Classic 5-stage pipeline: 1) Instruction Fetch (Ifetch), 2) Register Read (Reg), 3) Execute (ALU), 4) Data Memory Access (Dmem), 5) Register Write (Reg)
1/26/2014
29
29
Pipelined Instruction Execution

Time (clock cycles)
Cycle 1 Cycle 2 Cycle 3 Cycle 4 Cycle 5 Cycle 6 Cycle 7
ALU
I n s t r.
O r d e r
ALU
Ifetch
Reg
DMem
Reg
Ifetch
Reg
DMem
Reg
ALU
Ifetch
Reg
DMem
Reg
ALU
Ifetch
Reg
DMem
Reg
CS252-s06, Lec 01-intro 1/26/2014
30
30
Limits to pipelining
Hazards prevent next instruction from executing during its designated clock cycle
Structural hazards: attempt to use the same hardware to do two different things at once Data hazards: Instruction depends on result of prior instruction still in the pipeline Control hazards: Caused by delay between the fetching of instructions and decisions about changes in control flow (branches and jumps).
1/26/2014
31
31
END
32

MIPS Introduction

Încărcat de

Informații document

Titlu original

Drepturi de autor

Formate disponibile

Partajați acest document

Partajați sau inserați document

Opțiuni de partajare

Vi se pare util acest document?

Este necorespunzător acest conținut?

Drepturi de autor:

Formate disponibile

MIPS Introduction

Încărcat de

Drepturi de autor:

Formate disponibile

Computer Architecture

A Quantitative Approach, Fifth Edition

Chapter 1 Fundamentals of Quantitative Design and Analysis

Copyright 2012, Elsevier Inc. All rights reserved.

Improvements in semiconductor technology

Improvements in computer architectures

Together have enabled:

Lightweight computers Productivity-based managed/interpreted programming languages

Copyright 2012, Elsevier Inc. All rights reserved.

Single Processor Performance

Copyright 2012, Elsevier Inc. All rights reserved.

Current Trends in Architecture

Cannot continue to leverage Instruction-Level parallelism (ILP)

Single processor performance improvement ended in 2003

New models for performance:

Data-level parallelism (DLP) Thread-level parallelism (TLP) Request-level parallelism (RLP)

These require explicit restructuring of the application

Personal Mobile Device (PMD)

Clusters / Warehouse Scale Computers

Classes of parallelism in applications:

Data-Level Parallelism (DLP) Task-Level Parallelism (TLP)

Classes of architectural parallelism:

Copyright 2012, Elsevier Inc. All rights reserved.

Vector architectures Multimedia extensions Graphics processor units

Multiple instruction streams, single data stream (MISD)

Multiple instruction streams, multiple data streams (MIMD)

Tightly-coupled MIMD Loosely-coupled MIMD

Defining Computer Architecture

Defining Computer Architecture

Old view of computer architecture:

Instruction Set Architecture (ISA) design i.e. decisions regarding:

Real computer architecture:

Copyright 2012, Elsevier Inc. All rights reserved.

Integrated circuit technology

Transistor density: 35%/year Die size: 10-20%/year Integration overall: 40-55%/year

DRAM capacity: 25-40%/year (slowing) Flash capacity: 50-60%/year

15-20X cheaper/bit than DRAM

Magnetic disk technology: 40%/year

15-25X cheaper/bit then Flash 300-500X cheaper/bit than DRAM

Copyright 2012, Elsevier Inc. All rights reserved.

Bandwidth and Latency

Latency or response time

Copyright 2012, Elsevier Inc. All rights reserved.

Bandwidth and Latency

Log-log plot of bandwidth and latency milestones

Transistors and Wires

Wire delay does not improve with feature size!

Integration density scales quadratically

Copyright 2012, Elsevier Inc. All rights reserved.

Trends in Power and Energy

Power and Energy

Trends in Power and Energy

Dynamic Energy and Power

Transistor switch from 0 -> 1 or 1 -> 0 x Capacitive load x Voltage2

x Capacitive load x Voltage2 x Frequency switched

Reducing clock rate reduces power, not energy

Copyright 2012, Elsevier Inc. All rights reserved.

Trends in Power and Energy

Copyright 2012, Elsevier Inc. All rights reserved.

Trends in Power and Energy

Techniques for reducing power:

Copyright 2012, Elsevier Inc. All rights reserved.

Trends in Power and Energy