CS61C L01 Introduction + Numbers (1) Beamer, Summer 2007 © UCBScott BeamerInstructorinst.eecs.berkeley.edu/~cs61cinst.eecs.berkeley.edu/~cs61cCS61C : Machine StructuresLecture #1 – Number Representation2007-06-25Valerie Ishida, TAClark Leung, TACS61C L01 Introduction + Numbers (2) Beamer, Summer 2007 © UCB“I stand on the shoulders of giants…”Thanks to these talented folks (& many others)whose contributions have helped make 61C areally tremendous course!ProfDavidPattersonProfJohnWawrznekTAAndyCarleLec. SOEDan GarciaCS61C L01 Introduction + Numbers (3) Beamer, Summer 2007 © UCBWhere does CS61C fit in?http://hkn.eecs.berkeley.edu/student/cs-prereq-chart1.gifBC swap?We will not be enforcing the CS61B prerequisite this semester.CS61C L01 Introduction + Numbers (4) Beamer, Summer 2007 © UCBAre Computers Smart?• To a programmer:• Very complex operations / functions:- (map (lambda (x) (* x x)) ‘(1 2 3 4))• Automatic memory management:- List l = new List;• “Basic” structures:- Integers, floats, characters, plus, minus,print commandsComputersare smart!CS61C L01 Introduction + Numbers (5) Beamer, Summer 2007 © UCBAre Computers Smart?• In real life:• Only a handful of operations:- {and, or, not}• No memory management.• Only 2 values:- {0, 1} or {low, high} or {off, on}Computersare dumb!CS61C L01 Introduction + Numbers (6) Beamer, Summer 2007 © UCB61CWhat are “Machine Structures”?* Coordination of manylevels (layers) of abstractionI/O systemProcessorCompilerOperatingSystem(Mac OSX)Application (ex: browser)Digital DesignCircuit DesignInstruction Set ArchitectureDatapath & Control transistorsMemoryHardwareSoftwareAssemblerCS61C L01 Introduction + Numbers (7) Beamer, Summer 2007 © UCB61C Levels of Representationlw $t0, 0($2)lw $t1, 4($2)sw $t1, 0($2)sw $t0, 4($2)High Level LanguageProgram (e.g., C)Assembly LanguageProgram (e.g.,MIPS)Machine LanguageProgram (MIPS)Hardware Architecture Description(Logic, Logisim, etc.)CompilerAssemblerMachineInterpretationtemp = v[k];v[k] = v[k+1];v[k+1] = temp;0000 1001 1100 0110 1010 1111 0101 10001010 1111 0101 1000 0000 1001 1100 0110 1100 0110 1010 1111 0101 1000 0000 1001 0101 1000 0000 1001 1100 0110 1010 1111 Logic Circuit Description(Logisim, etc.)ArchitectureImplementationCS61C L01 Introduction + Numbers (8) Beamer, Summer 2007 © UCBAnatomy: 5 components of any ComputerPersonal Computer Processor ComputerControl(“brain”)Datapath(“brawn”)Memory(where programs, data live whenrunning)DevicesInputOutputKeyboard, MouseDisplay, PrinterDisk(whereprograms,datalive whennot running)CS61C L01 Introduction + Numbers (9) Beamer, Summer 2007 © UCBOverview of Physical Implementations• Integrated Circuits (ICs)• Combinational logic circuits, memory elements,analog interfaces.• Printed Circuits (PC) boards• substrate for ICs and interconnection, distribution ofCLK, Vdd, and GND signals, heat dissipation.• Power Supplies• Converts line AC voltage to regulated DC low voltagelevels.• Chassis (rack, card case, ...)• holds boards, power supply, provides physicalinterface to user or other systems.• Connectors and Cables.The hardware out of which we make systems.CS61C L01 Introduction + Numbers (10) Beamer, Summer 2007 © UCBIntegrated Circuits (2006 state-of-the-art)• Primarily Crystalline Silicon• 1mm - 25mm on a side• 2006 - feature size ~ 65nm = 6.5 x 10-8m• 100 - 800M transistors• (25 - 100M “logic gates")• 3 - 10 conductive layers• “CMOS” (complementary metal oxidesemiconductor) - most common.• Package provides:• spreading of chip-level signal paths toboard-level• heat dissipation.• Ceramic or plastic with gold wires.Chip in PackageBare DieCS61C L01 Introduction + Numbers (11) Beamer, Summer 2007 © UCBPrinted Circuit Boards• fiberglass or ceramic• 1-20 conductivelayers• 1-20in on a side• IC packages aresoldered down.CS61C L01 Introduction + Numbers (12) Beamer, Summer 2007 © UCBTechnology Trends: Memory Capacity(Single-Chip DRAM)sizeY e a rB i t s10001000010000 0100000010000000100 00000 0100 00000 001970 1975 1980 1 985 1990 19 95 20 00year size (Mbit)1980 0.06251983 0.251986 11989 41992 161996 641998 1282000 2562002 512• Now 1.4X/yr, or 2X every 2 years.• 8000X since 1980!CS61C L01 Introduction + Numbers (13) Beamer, Summer 2007 © UCBY e a rT r a n s i s t o rs100010000100 000100 0000100 00000100 0000001970 1975 1980 1985 1990 1995 2000i8 038 6i4 0 04i8 0 80Pen tiumi8 048 6i8 028 6i8 0 86Technology Trends: MicroprocessorComplexity2X transistors/ChipEvery 1.5 yearsCalled “Moore’s Law” Alpha 21264: 15 millionPentium Pro: 5.5 millionPowerPC 620: 6.9 millionAlpha 21164: 9.3 millionSparc Ultra: 5.2 millionMoore’s LawAthlon (K7): 22 MillionItanium 2: 41 MillionCS61C L01 Introduction + Numbers (14) Beamer, Summer 2007 © UCBTechnology Trends: Processor Performance010020030040050060070080090087 88 89 90 91 92 93 94 95 96 97DEC Alpha 21264/600DEC Alpha 5/500DEC Alpha 5/300DEC Alpha 4/266IBM POWER 1001.54X/yrIntel P4 2000 MHz(Fall 2001)We’ll talk about processor performance later on…yearPerformance measureCS61C L01 Introduction + Numbers (15) Beamer, Summer 2007 © UCBComputer Technology - Dramatic Change!• Memory• DRAM capacity: 2x / 2 years (since ‘96);64x size improvement in last decade.• Processor• Speed 2x / 1.5 years (since ‘85);100X performance in last decade.• Disk• Capacity: 2x / 1 year (since ‘97)250X size in last decade.CS61C L01 Introduction + Numbers (16) Beamer, Summer 2007 © UCBComputer Technology - Dramatic Change!• State-of-the-art PC when you graduate:(at least…)• Processor clock speed: 5000 MegaHertz (5.0 GigaHertz)• Memory capacity: 8000 MegaBytes(8.0 GigaBytes)• Disk capacity: 2000 GigaBytes(2.0 TeraBytes)• New units! Mega => Giga, Giga => Tera(Tera => Peta, Peta => Exa, Exa => ZettaZetta => Yotta = 1024)We’ll see that Kilo, Mega, etc. are incorrect later!CS61C L01 Introduction + Numbers (17) Beamer, Summer 2007 © UCBCS61C: So what's in it for me?• Learn some of the big ideas in CS & engineering:• 5 Classic components of a Computer• Data can be anything (integers, floating point,characters): a program determines what it is• Stored program concept: instructions just data• Principle of Locality, exploited via a memory hierarchy(cache)• Greater performance by exploiting parallelism• Principle of abstraction, used to build systems aslayers• Compilation v. interpretation thru
View Full Document
Unlocking...