DOC PREVIEW
Berkeley COMPSCI 61C - Lecture Notes

This preview shows page 1-2 out of 6 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 6 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 6 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 6 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

CS 61C L01 Introduction + Numbers (1)A Carle -- Su 2005 © UCBinst.eecs.berkeley.edu/~cs61cCS61C : Machine StructuresLecture #1 – Introduction & Numbers2005-06-20Andy CarleCS 61C L01 Introduction + Numbers (2)A Carle -- Su 2005 © 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 commandsComputers are smart!CS 61C L01 Introduction + Numbers (3)A Carle -- Su 2005 © UCBAre Computers Smart?°In real life:• Only a handful of operations:- {and, or, not} or {nand, nor}• No memory management.• Only 2 values: - {0, 1} or {hi, lo} or {on, off}- 3 if you count <undef>Computers are dumb!CS 61C L01 Introduction + Numbers (4)A Carle -- Su 2005 © UCB61CWhat are “Machine Structures”?*Coordination of many levels (layers) of abstractionI/O systemProcessorCompilerOperatingSystem(WinXP)Application (ex: browser)Digital DesignCircuit DesignInstruction SetArchitectureDatapath & Control transistorsMemoryHardwareSoftwareAssemblerCS 61C L01 Introduction + Numbers (5)A Carle -- Su 2005 © UCB61C Levels of Representationlw $t0, 0($2)lw $t1, 4($2)sw $t1, 0($2)sw $t0, 4($2)High Level Language Program (e.g., C)Assembly Language Program (e.g.,MIPS)Machine Language Program (MIPS)Hardware Architecture Description (Logic, Logisim, etc.)CompilerAssemblerMachine Interpretationtemp = 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 1111Logic Circuit Description (Logisim, etc.)Architecture ImplementationCS 61C L01 Introduction + Numbers (6)A Carle -- Su 2005 © UCBAnatomy: 5 components of any ComputerPersonal ComputerProcessorComputerControl(“brain”)Datapath(“brawn”)Memory(where programs, data live whenrunning)DevicesInputOutputKeyboard, MouseDisplay, PrinterDisk(where programs, data live whennot running)CS 61C L01 Introduction + Numbers (7)A Carle -- Su 2005 © UCBOverview of Physical Implementations° Integrated Circuits (ICs)• Combinational logic circuits, memory elements, analog interfaces. ° Printed Circuits (PC) boards• substrate for ICs and interconnection, distribution of CLK, Vdd, and GND signals, heat dissipation. ° Power Supplies• Converts line AC voltage to regulated DC low voltage levels. ° Chassis (rack, card case, ...) • holds boards, power supply, provides physical interface to user or other systems. ° Connectors and Cables. The hardware out of which we make systems.CS 61C L01 Introduction + Numbers (8)A Carle -- Su 2005 © UCBIntegrated Circuits (2003 state-of-the-art)° Primarily Crystalline Silicon° 1mm - 25mm on a side° 2003 - feature size ~ 0.13µm = 0.13 x 10-6m ° 100 - 400M transistors° (25 - 100M “logic gates")° 3 - 10 conductive layers° “CMOS” (complementary metal oxide semiconductor) - most common.° Package provides:• spreading of chip-level signal paths to board-level • heat dissipation. ° Ceramic or plastic with gold wires. Chip in PackageBare DieCS 61C L01 Introduction + Numbers (9)A Carle -- Su 2005 © UCBPrinted Circuit Boards° fiberglass or ceramic° 1-20 conductive layers ° 1-20in on a side ° IC packages are soldered down.CS 61C L01 Introduction + Numbers (10)A Carle -- Su 2005 © UCBTechnology Trends: Memory Capacity(Single-Chip DRAM)sizeYear10001000010000010000001000000010000000010000000001970 1975 1980 1985 1990 1995 2000year 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!CS 61C L01 Introduction + Numbers (11)A Carle -- Su 2005 © UCBYear1000100001000001000000100000001000000001970 1975 1980 1985 1990 1995 2000i80386i4004i8080Pentiumi80486i80286i8086Technology Trends: Microprocessor Complexity2X transistors/ChipEvery 1.5 yearsCalled“Moore’s Law”Alpha 21264: 15 millionPentiumPro: 5.5 millionPowerPC 620: 6.9 millionAlpha 21164: 9.3 millionSparc Ultra: 5.2 millionMoore’s LawAthlon (K7): 22 MillionItanium 2: 41 MillionCS 61C L01 Introduction + Numbers (12)A Carle -- Su 2005 © 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 measureCS 61C L01 Introduction + Numbers (13)A Carle -- Su 2005 © 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.CS 61C L01 Introduction + Numbers (14)A Carle -- Su 2005 © UCBComputer Technology - Dramatic Change!°State-of-the-art PC when you graduate: (at least…)• Processor clock speed: 5000 MegaHertz(5.0 GigaHertz)• Memory capacity: 4000 MegaBytes(4.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!CS 61C L01 Introduction + Numbers (15)A Carle -- Su 2005 © 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 as layers• Compilation v. interpretation thru system layers• Principles/Pitfalls of Performance MeasurementCS 61C L01 Introduction + Numbers (16)A Carle -- Su 2005 © UCBOthers Skills learned in 61C°Learning C• If you know one, you should be able to learn another programming language largely on your own• Given that you know C++ or Java, should be easy to pick up their ancestor, C°Assembly Language Programming• This is a skill you will pick up, as a side effect of understanding the Big Ideas°Hardware design• We think of hardware at the abstract level, with only a little bit of physical logic to give things perspective• CS 150,


View Full Document

Berkeley COMPSCI 61C - Lecture Notes

Documents in this Course
SIMD II

SIMD II

8 pages

Midterm

Midterm

7 pages

Lecture 7

Lecture 7

31 pages

Caches

Caches

7 pages

Lecture 9

Lecture 9

24 pages

Lecture 1

Lecture 1

28 pages

Lecture 2

Lecture 2

25 pages

VM II

VM II

4 pages

Midterm

Midterm

10 pages

Load more
Download Lecture Notes
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view Lecture Notes and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Lecture Notes 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?