CSE 141. Exponential Growth

Similar documents
CS 265. Computer Architecture. Wei Lu, Ph.D., P.Eng.

What s inside your computer? Session 3. Peter Henderson

CC312: Computer Organization

Alternate definition: Instruction Set Architecture (ISA) What is Computer Architecture? Computer Organization. Computer structure: Von Neumann model

Evolution of the Computer

CS Computer Architecture Spring Lecture 01: Introduction

CS430 - Computer Architecture William J. Taffe Fall 2002 using slides from. CS61C - Machine Structures Dave Patterson Fall 2000

CMPSCI 201: Architecture and Assembly Language

EE382 Processor Design. Class Objectives

IT 252 Computer Organization and Architecture. Introduction. Chia-Chi Teng

Chapter 1: Introduction to the Microprocessor and Computer 1 1 A HISTORICAL BACKGROUND

Here is a diagram of a simple computer system: (this diagram will be the one needed for exams) CPU. cache

Where we are going (today)

Where we are going (today)

Computer Systems. Hardware, Software and Layers of Abstraction

ENIAC - background. ENIAC - details. Structure of von Nuemann machine. von Neumann/Turing Computer Architecture

Figure 1-1. A multilevel machine.

Computer & Microprocessor Architecture HCA103

CS61C : Machine Structures

Chapter 2: Computer-System Structures. Hmm this looks like a Computer System?

Uniprocessor Computer Architecture Example: Cray T3E

CPE/EE 421 Microcomputers

Introduction To Computer Hardware

COMP 102: Computers and Computing Lecture 1: Introduction!

Introduction to computers

CSE 451: Operating Systems Spring Module 12 Secondary Storage. Steve Gribble

ELEC 5200/6200. Computer Architecture & Design. Victor P. Nelson Broun 326

Computer Science 324 Computer Architecture Mount Holyoke College Fall Topic Notes: Bits and Bytes and Numbers

Alex Milenkovich 1. CPE/EE 421 Microcomputers. CPE/EE 421 Microcomputers U A H U A H U A H. Instructor: Dr Aleksandar Milenkovic Lecture Notes S01

Where we are going (today)

Computer Organization & Assembly Language Programming (CSE 2312)

Microelettronica. J. M. Rabaey, "Digital integrated circuits: a design perspective" EE141 Microelettronica

Introduction to computers

Introduction 1. GENERAL TRENDS. 1. The technology scale down DEEP SUBMICRON CMOS DESIGN

Introduction. Summary. Why computer architecture? Technology trends Cost issues

CS 1 Notes 1 - Early Computing and 2 - Electronic Computing

Computer Organization & Assembly Language Programming (CSE 2312)

Name: Date: Hour: The abacus (still in use today) is about 5,000 years old. Not a computer.

New Advances in Micro-Processors and computer architectures

The trusted, student-friendly online reference tool. Name: Date:

Even coarse architectural trends impact tremendously the design of systems

Computer Architecture Computer Architecture. Computer Architecture. What is Computer Architecture? Grading

Performance COE 403. Computer Architecture Prof. Muhamed Mudawar. Computer Engineering Department King Fahd University of Petroleum and Minerals

HISTORY OF COMPUTERS HISTORY OF COMPUTERS. Mesleki İngilizce - Technical English. Punch Card. Digital Data. II Prof. Dr. Nizamettin AYDIN.

Computer Architecture

Lecture 2: Technology Trends Prof. Randy H. Katz Computer Science 252 Spring 1996

Even coarse architectural trends impact tremendously the design of systems

CSE 451: Operating Systems Winter Module 2 Architectural Support for Operating Systems

LECTURE 1. Introduction

Reducing Hit Times. Critical Influence on cycle-time or CPI. small is always faster and can be put on chip

Even coarse architectural trends impact tremendously the design of systems. Even coarse architectural trends impact tremendously the design of systems

Question?! Processor comparison!

Lecture 1: What is a computer?

Lyman Briggs Lecture Series. Group Question. Discussion Questions. Definition of Computer. Definition of Modern Computer. Definition of a Computer

Chapter 2. Perkembangan Komputer

CENG4480 Lecture 09: Memory 1

Introduction. Outline. 1.1 Overview. 1.1 Overview

Introduction to computers

time step first instruction second instruction

ECE 261: Full Custom VLSI Design

Computer Architecture!

Monday, January 27, 2014

Number Representations

Topic 18 (updated): Virtual Memory

Introduction To Computers

1 Motivation for Improving Matrix Multiplication

Introduction To Computers: Hardware

Overview. Memory Classification Read-Only Memory (ROM) Random Access Memory (RAM) Functional Behavior of RAM. Implementing Static RAM

ENGIN 112 Intro to Electrical and Computer Engineering


History. 3rd Generation- Integrated Circuits, Transistors (Integrated Circuit form) for Memory ( memory is now volatile), Terminal/Keyboard for I/O

IF1 --> IF2 ID1 ID2 EX1 EX2 ME1 ME2 WB. add $10, $2, $3 IF1 IF2 ID1 ID2 EX1 EX2 ME1 ME2 WB sub $4, $10, $6 IF1 IF2 ID1 ID2 --> EX1 EX2 ME1 ME2 WB

ECE 468 Computer Architecture and Organization Lecture 1

Wednesday, January 28, 2018

Computer Architecture s Changing Definition

(Refer Slide Time: 1:27)

Computer Architecture

CS 61C: Great Ideas in Computer Architecture. Direct Mapped Caches

Section 4.3. Graphing Exponential Functions

CS 3410: Computer System Organization and Programming

Computer System architectures

The Server-Storage Performance Gap

HW Trends and Architectures

Memory Hierarchy Technology. The Big Picture: Where are We Now? The Five Classic Components of a Computer

Preview Notes. Systems of Equations. Linear Functions. Let y = y. Solve for x then solve for y

Topic Notes: Bits and Bytes and Numbers

NAME: 1a. (10 pts.) Describe the characteristics of numbers for which this floating-point data type is well-suited. Give an example.

Let!s go back to a course goal... Let!s go back to a course goal... Question? Lecture 22 Introduction to Memory Hierarchies

Part I. Problems in this section are mostly short answer and multiple choice. Little partial credit will be given. 5 points each.

CSE 451: Operating Systems Spring Module 12 Secondary Storage

Computer Memory Basic Concepts. Lecture for CPSC 5155 Edward Bosworth, Ph.D. Computer Science Department Columbus State University

EITF20: Computer Architecture Part1.1.1: Introduction

2011 Francisco Delgadillo

PREPARED BY S.RAVINDRAKUMAR, SENIOR ASSISTANT PROFESSOR/ECE,CHETTINAD COLLEGE OF ENGINEERING AND TECHNOLOGY Page 1

Picture of memory. Word FFFFFFFD FFFFFFFE FFFFFFFF

Section 2.3 (e-book 4.1 & 4.2) Rational Functions

Introduction to Computer Science

Lecture Topics. Announcements. Today: The MIPS ISA (P&H ) Next: continued. Milestone #1 (due 1/26) Milestone #2 (due 2/2)

An Incomplete History of Computation

Topic Notes: Bits and Bytes and Numbers

Transcription:

CSE 141 Exponential Growth 1200 1100 DEC Alpha 21264/600 1000 900 800 Performance 700 600 500 400 DEC Alpha 5/500 300 200 100 SUN-4/ 260 0 1987 MIPS M/120 1988 MIPS M2000 1989 IBM RS6000 1990 1991 DEC Alpha 5/300 DEC Alpha 4/266 IBM POWER 100 DEC AXP/500 HP 9000/750 1992 Year 1993 1994 1995 1996 1997 1/16/02

Notation for CSE 141 K = kilo = 1000 M = mega = 1,000,000 bit not capitalized B or Byte capitalized Exception: for memory, KByte = 2 10 Bytes, MByte = 2 20 Bytes, For BOTEE s, 2 10 = 10 3. G = giga = 10 9 T = tera = 10 12. P = peta = 10 15. m = milli =.001 u (or µ) = micro = 10 6 n = nano = 10 9 Always keep units (ns, KB, $,...) around in calculations. They make a good check. 2

News from the NYTimes (June 96) When a computer runs out of [RAM memory], modern operating systems automatically use the memory on the hard drive. But today s hard drives retrieve data at speeds of about 10 milliseconds (millionths of a second). That seems fast until you consider that modern RAM can do this at 60 nanoseconds (billionths of a second), more than 150 times as fast. What s wrong with the above statement?? 1 Extra Credit point to first person to show me obvious innumeracy in current reputable newspaper. Limit: 2 points per person. 3

DRAM Capacity Graph shows capacity (in thousands of bits) of largest DRAM chip. Has all growth has been in the last decade?? 1200000 1000000 800000 600000 400000 200000 0 4 1975 1985 1995 2005

Logarithmic Scale y axis is log (base 2) of capacity (in bits) of largest DRAM chip 35 30 25 20 15 10 5 0 1975 1985 1995 2005 5

DRAM growth rule gets 4 times larger DRAM capacity quadruples every three years Remarkably consistent over last 25 years. Introduction of 1 Mbit chip came a year early. 64 Mbit chip (and larger ones?) coming a year late. To some extent, a self-fulfilling prophecy. Improvement due to smaller lithography and to increased chip size. Chips aren t profitable until they are small. 6

The news from www.news.com 16 Mbit DRAM can store information from 128 newspaper pages. 2 24 bits / 2 7 pages = 2 17 bit/page 4 Gbit DRAM can store 16,000 newspaper pages of information. 2 32 bits / 2 14 pages = 2 18 bit/page Are newspaper pages getting larger? You should be able to do power-of-2 computations like this very easily. Perhaps bits hold less information than in good old days?? 7

Using a log scale graph Here are 4 functions drawn as ordinary graph. 15000 10000 5000 0 2 4 6 8 10 12 14 16 y = 1.5^x y = (2^x)/5 y = 20 x y = 3 x^2 8

Using a log scale graph Good for exponential growth. slope is base of exponent (y-intercept is multiplier) 100000 10000 1000 Red and Blue lines grow exponentially (they are straight) 100 10 1 2 4 6 8 10 12 14 16 0.1 y = 1.5^x y = (2^x)/5 y = 20 x y = 3 x^2 9

Aside: what about log-log graph? Good for polynomial growth. slope is exponent (if scales are same, which they aren t here) 100000 10000 1000 Cyan and green lines grow polynomially (they are straight) 100 10 1 2 4 8 16 0.1 y = 1.5^x y = (2^x)/5 y = 20 x y = 3 x^2 10

11 Larry s Rule of 72 Something that grows at x% a year will double about every 72/x years. Examples: If you get 6% interest on bond, value will double in 72/6 = 12 years. If world population grows by 2% a year, it will double every 72/2 = 36 years. If DRAM access time drops by 9% a year, it will take 72/9 = 8 years to drop by half. If DRAM capacity doubles every 18 months, it increases by an average of 72/18=4% per month.

How close is rule of 72? Accurate within 5% for p up to about 18. For p < 4, Rule of 70 is a little better For p > 20, approximation is lousy! p 1 2 3 6 12 18 24 72/p 72 36 24 12 6 4 3 growth after 72/p steps 2.05 2.04 2.03 2.01 1.97 1.94 1.91 12

Justification of rule of 72 Suppose x(t) is p% larger than x(t-1). x(1) = x(0) (1+p/100) x(2) = x(1) (1+p/100) = x(0) (1+p/100) 2 more generally, x(t) = x(0) (1+p/100) t From calculus: e = lim (1+1/x) x. x So for large enough x, e (1+1/x) x. Choose x so that 1/x = p/100 (i.e. x = 100/p) Then (1+p/100) t = (1+1/x) t = (1+1/x) xt/x e t/x = e tp/100. So if x(t)/x(0) = 2, then (1+p/100) t = 2, so e tp/100 2. Thus, tp/100 ln 2 =.69314, i.e. tp 69.314... I use 72 since it s easy, and closer for medium-sized p. 13

Clock speed on a logarithmic scale... MHz of Intel x86 series chips 1000 100 10 Dashed lines: double every 2 years 1 1980 1985 1990 1995 2000 Workstation Performance 14

Aside: a 30x change is BIG Changing something by a factor of 30 usually makes a qualitative change. 10 people/square mile farmland 300 p/mi^2 suburbia 10,000 p/mi^2 big city 2 mph walking 60 mph driving 900 mph fast jet 100 square feet dorm room 3000 ft^2 good sized house 100,000 ft^2 hotel Computers are making such changes every decade (or faster). 15

Performance Trends 1200 1100 DEC Alpha 21264/600 1000 900 800 Performance 700 600 500 400 DEC Alpha 5/500 300 200 100 SUN-4/ 260 0 1987 MIPS M/120 1988 MIPS M2000 1989 IBM RS6000 1990 1991 IBM POWER 100 DEC AXP/500 HP 9000/750 1992 Year 1993 1994 DEC Alpha 4/266 1995 DEC Alpha 5/300 1996 1997 16

Performance on a logarithmic scale... 10000 1000 100 10 Dashed lines: double every 1.5 years 1 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 Workstation Performance 17

Memory Evolution Transistors get smaller, chips get larger, results is... DRAM chip capacity doubles every 1.5 years Processor Evolution Transistor count doubles every 2 years Clock speed doubles every 2 years Memory speeds increase a tiny bit and then a miracle occurs... Performance doubles every 1.5 years 18

19 Why is this surprising? You d expect processor speed to increase with the slowest technology P&H estimate DRAM access time decreases 9% per year. So memory speed doubles about every??? years. Yet performance doubles faster than clock speed! And much faster than DRAM access time. Somehow, added transistors are being used effectively. Sure, maybe you can wash your car faster with 4 people. But does having 16 or 64 people help??? Later part of course is about how this happens!

When will computer exceed brain? Human brain has about 10 billion neurons. Each is connected to about 100,000 other neurons. A neuron can fire about 1000 times/sec. Estimate when microprocessors will exceed a human s brainpower. Assume each fire decision corresponds to computation of 100,000 transistors (one per connection) for one clock cycle. 20

Machine of the day Babbage s engines Difference engine Started 1847; completed 1991 (London Science Museum) Very big calculator 11 feet long, 7 feet high, 4000 parts Analytical engine Had Mill (processor) and Store (memory) Had conditional branches; could execute loops Op code and address written on separate punch cards Neither machine completed by Babbage Small analytical engine built by his son; calculated multiples of pi (incorrectly) First programmer: Ada Lovelace 21