1/16/02CSE 141 - Exponential Growth CSE 141 Exponential Growth.

Slides:



Advertisements
Similar presentations
CS492B Analysis of Concurrent Programs Memory Hierarchy Jaehyuk Huh Computer Science, KAIST Part of slides are based on CS:App from CMU.
Advertisements

Performance of Cache Memory
Introduction to Algorithms Rabie A. Ramadan rabieramadan.org 2 Some of the sides are exported from different sources.
Chapter Six 1.
The C P U In this lesson you will learn about the Press Enter or Click to continue Central Processing Unit.
Tuan Tran. What is CISC? CISC stands for Complex Instruction Set Computer. CISC are chips that are easy to program and which make efficient use of memory.
Cache Memory Locality of reference: It is observed that when a program refers to memory, the access to memory for data as well as code are confined to.
CSE332: Data Abstractions Lecture 2: Math Review; Algorithm Analysis Tyler Robison Summer
1  1998 Morgan Kaufmann Publishers Chapter Seven Large and Fast: Exploiting Memory Hierarchy.
1 Lecture 16B Memories. 2 Memories in General Computers have mostly RAM ROM (or equivalent) needed to boot ROM is in same class as Programmable Logic.
Computational Astrophysics: Methodology 1.Identify astrophysical problem 2.Write down corresponding equations 3.Identify numerical algorithm 4.Find a computer.
Computer ArchitectureFall 2007 © November 7th, 2007 Majd F. Sakr CS-447– Computer Architecture.
1 Programming & Programming Languages Overview l Machine operations and machine language. l Example of machine language. l Different types of processor.
1 Lecture 16B Memories. 2 Memories in General RAM - the predominant memory ROM (or equivalent) needed to boot ROM is in same class as Programmable Logic.
1 CSE SUNY New Paltz Chapter Seven Exploiting Memory Hierarchy.
1 Microprocessor speeds Measure of system clock speed –How many electronic pulses the clock produces per second (clock frequency) –Usually expressed in.
Lecture 24: CPU Design Today’s topic –Multi-Cycle ALU –Introduction to Pipelining 1.
How a Computer Processes Data Hardware. Major Components Involved: Central Processing Unit Types of Memory Motherboards Auxiliary Storage Devices.
The Nature of Exponential Growth Writing growth and decay problems with base e.
(2.1) Fundamentals  Terms for magnitudes – logarithms and logarithmic graphs  Digital representations – Binary numbers – Text – Analog information 
Random access memory.
 Design model for a computer  Named after John von Neuman  Instructions that tell the computer what to do are stored in memory  Stored program Memory.
Lecture 1: What is a Modern Computer
1.2. Comparing Algorithms. Learning outcomes Understand that algorithms can be compared by expressing their complexity as a function relative to the size.
1 Dr. Michael D. Featherstone Introduction to e-Commerce Laws of the Web.
Multi-core Programming Introduction Topics. Topics General Ideas Moore’s Law Amdahl's Law Processes and Threads Concurrency vs. Parallelism.
CSCI-256 Data Structures & Algorithm Analysis Lecture Note: Some slides by Kevin Wayne. Copyright © 2005 Pearson-Addison Wesley. All rights reserved. 4.
1 CSCI 2510 Computer Organization Memory System I Organization.
Memory  Main memory consists of a number of storage locations, each of which is identified by a unique address  The ability of the CPU to identify each.
3/15/2002CSE Final Remarks Concluding Remarks SOAP.
IT Groundwork ICS3UC - Unit 1 Hardware. Overview of Computer System.
Computer Organization & Assembly Language © by DR. M. Amer.
Ted Pedersen – CS 3011 – Chapter 10 1 A brief history of computer architectures CISC – complex instruction set computing –Intel x86, VAX –Evolved from.
Objective: To express and find the value of numbers using an exponent and a base 14.1 Introduction to Exponents.
Copyright © 2014 Curt Hill Growth of Functions Analysis of Algorithms and its Notation.
Morgan Kaufmann Publishers
1 COMS 361 Computer Organization Title: Performance Date: 10/02/2004 Lecture Number: 3.
Stored Programs In today’s lesson, we will look at: what we mean by a stored program computer how computers store and run programs what we mean by the.
1 Chapter Seven. 2 Users want large and fast memories! SRAM access times are ns at cost of $100 to $250 per Mbyte. DRAM access times are ns.
Multilevel Caches Microprocessors are getting faster and including a small high speed cache on the same chip.
1 Chapter Seven CACHE MEMORY AND VIRTUAL MEMORY. 2 SRAM: –value is stored on a pair of inverting gates –very fast but takes up more space than DRAM (4.
CSE 373: Data Structures and Algorithms
Chapter VI What should I know about the sizes and speeds of computers?
07/11/2005 Register File Design and Memory Design Presentation E CSE : Introduction to Computer Architecture Slides by Gojko Babić.
What is it and why do we need it? Chris Ward CS147 10/16/2008.
1 Chapter Seven. 2 SRAM: –value is stored on a pair of inverting gates –very fast but takes up more space than DRAM (4 to 6 transistors) DRAM: –value.
COMPSYS 304 Computer Architecture Cache John Morris Electrical & Computer Enginering/ Computer Science, The University of Auckland Iolanthe at 13 knots.
1 5. Abstract Data Structures & Algorithms 5.6 Algorithm Evaluation.
SPRING 2012 Assembly Language. Definition 2 A microprocessor is a silicon chip which forms the core of a microcomputer the concept of what goes into a.
Information Technology (IT). Information Technology – technology used to create, store, exchange, and use information in its various forms (business data,
William Stallings Computer Organization and Architecture 6th Edition
GCSE Computing - The CPU
By Ferdinand V Cenon Computer Studies Syllabus Reference by Ferdinand V Cenon
Math for APES Calculations Without Calculators
Chapter 2.1 CPU.
Math for APES Calculations Without Calculators
CS-301 Introduction to Computing Lecture 17
7. The tuition at a private college can be modeled by the equation ,
Big O Notation.
Memory Hierarchy Memory: hierarchy of components of various speeds and capacities Hierarchy driven by cost and performance In early days Primary memory.
Math for APES Calculations Without Calculators
COMS 361 Computer Organization
Memory Hierarchy Memory: hierarchy of components of various speeds and capacities Hierarchy driven by cost and performance In early days Primary memory.
Math for APES Calculations Without Calculators
Math for APES Calculations Without Calculators
GCSE Computing - The CPU
Course Code 114 Introduction to Computer Science
Algorithm Course Dr. Aref Rashad
Presentation transcript:

1/16/02CSE Exponential Growth CSE 141 Exponential Growth

CSE Exponential Growth2 Notation for CSE 141 K = kilo = 1000 M = mega = 1,000,000 –Exception: for memory, KByte = 2 10 Bytes, MByte = 2 20 Bytes, –For BOTEE’s, 2 10 = G = giga = 10 9 T = tera = P = peta = bit – not capitalized B or Byte – capitalized 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.

CSE Exponential Growth3 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.

CSE Exponential Growth4 DRAM Capacity Graph shows capacity (in thousands of bits) of largest DRAM chip. Has all growth has been in the last decade??

CSE Exponential Growth5 Logarithmic Scale y axis is log (base 2) of capacity (in bits) of largest DRAM chip

CSE Exponential Growth6 DRAM growth rule “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. gets 4 times larger

CSE Exponential Growth7 The news from “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? Perhaps bits hold less information than in “good old days”?? You should be able to do power-of-2 computations like this very easily.

CSE Exponential Growth8 Using a log scale graph Here are 4 functions drawn as ordinary graph.

CSE Exponential Growth9 Using a log scale graph Good for exponential growth. –slope is base of exponent (y-intercept is multiplier) Red and Blue lines grow exponentially (they are straight)

CSE Exponential Growth10 Aside: what about log-log graph? Good for polynomial growth. –slope is exponent (if scales are same, which they aren’t here) Cyan and green lines grow polynomially (they are straight)

CSE Exponential Growth11 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.

CSE Exponential Growth12 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 /p growth after 72/p steps

CSE Exponential Growth13 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. –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  –I use 72 since it’s easy, and closer for medium-sized p. xx

CSE Exponential Growth14 Clock speed on a logarithmic scale... Dashed lines: double every 2 years MHz of Intel x86 series chips

CSE Exponential Growth15 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).

CSE Exponential Growth16 Performance Trends

CSE Exponential Growth17 Performance on a logarithmic scale... Dashed lines: double every 1.5 years

CSE Exponential Growth18 Memory Evolution Transistors get smaller, chips get larger, results is... DRAM chip capacity doubles every 1.5 years 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 Processor Evolution

CSE Exponential Growth19 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!

CSE Exponential Growth20 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.

CSE Exponential Growth21 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