CMPSCI 201: Architecture and Assembly Language

Transcription

1 CMPSCI 201: Architecture and Assembly Language Deepak Ganesan Computer Science Department 1-1 Course Administration Instructor: Deepak Ganesan 250 CS Building Office Hrs: T 10:45-12:15, Tuesday TA: Jessica Krause jkrause@cs.umass.edu Office Hrs: posted on the course web page Labs: Accounts on EDLAB machines URL: Text: Introduction to Computing Systems: From bits and gates to C and beyond Slides: pdf on the course web page after lecture 1-2 1

2 Chapter 1 Welcome Aboard Slides based on: Gregory T. Byrd, NCSU What is a Computer? 1-4 2

3 Early Vacuum Tube 1-5 Accumulator (28 vacuum tubes) 3

4 ENIAC at Moore School, University of Pennsylvania 4

5 First Transistor 1-9 First Integrated Circuit

6 Modern Computers 1-11 What are computers?

7 Moore s Law In 1965, Gordon Moore predicted that the number of transistors that can be integrated on a die would double every 18 to 24 months (i.e., grow exponentially with time). Amazingly visionary million transistor/chip barrier was crossed in the 1980 s transistors, 1 MHz clock (Intel 4004) Million transistors (Ultra Sparc III) 42 Million transistors, 2 GHz clock (Intel Xeon) Million transistors, 3 GHz, 130nm technology, 250mm 2 die (Intel Pentium 4) Million transistor (HP PA-8500) 1-13 Processor Performance Increase Intel Pentium 4/3000 DEC Alpha 21264A/667 DEC Alpha 21264/600 Intel Xeon/2000 DEC Alpha 5/500 DEC Alpha 4/266 DEC Alpha 5/300 DEC AXP/500 IBM POWER 100 IBM RS6000 MIPS M2000 SUN-4/260 MIPS M/120 HP 9000/

8 DRAM Capacity Growth 4M 16M 128M 256M 512M 64M 1M 16K 64K 256K vs System IBM PC/AT Nokia 6682 Smartphone Year Cost $2000 $150 Form factor ½ desktop Pocket CPU 12 MHz MHz ARM Memory 512KB 8MB Storage 20MB hard disk, 1.2MB floppy 1GB mini-sd flash Display 80x25 monochrome text 176x208 pixel color Peripherals Keyboard Camera, phone, web

9 Introduction to the World of Computing Computer: electronic genius? NO! Electronic idiot! Does exactly what we tell it to, nothing more. Goal of the course: You will be able to write programs in C and understand what s going on underneath. Approach: Build understanding from the bottom up. Bits Gates Processor Instructions C Programming 1-17 Two Recurring Themes Abstraction Productivity enhancer don t need to worry about details Can drive a car without knowing how the internal combustion engine works. until something goes wrong! Where s the dipstick? What s a spark plug? Important to understand the components and how they work together. Hardware vs. Software It s not either/or both are components of a computer system. Even if you specialize in one, you should understand capabilities and limitations of both

10 Big Idea #1: Universal Computing Device All computers, given enough time and memory, are capable of computing exactly the same things. = = PDA Workstation Supercomputer 1-19 Turing Machine Mathematical model of a device that can perform any computation Alan Turing (1937) ability to read/write symbols on an infinite tape state transitions, based on current state and symbol Every computation can be performed by some Turing machine. (Turing s thesis) a,b T add a+b a,b T mul ab Turing machine that adds For more info about Turing machines, see Turing machine that multiplies For more about Alan Turing, see

11 Universal Turing Machine A machine that can implement all Turing machines -- this is also a Turing machine! inputs: data, plus a description of computation (other TMs) T add, T mul a,b,c U c(a+b) Universal Turing Machine U is programmable so is a computer! instructions are part of the input data a computer can emulate a Universal Turing Machine A computer is a universal computing device From Theory to Practice In theory, computer can compute anything that s possible to compute given enough memory and time In practice, solving problems involves computing under constraints. time weather forecast, next frame of animation,... cost cell phone, automotive engine controller,... power cell phone, handheld video game,

12 Big Idea #2: Transformations Between Layers Problems Algorithms Language Instruction Set Architecture Microarchitecture Circuits Devices 1-23 How do we solve a problem using a computer? A systematic sequence of transformations between layers of abstraction. Problem Algorithm Program Instr Set Architecture Software Design: choose algorithms and data structures Programming: use language to express design Compiling/Interpreting: convert language to machine instructions

13 Deeper and Deeper Instr Set Architecture Microarch Circuits Devices Processor Design: choose structures to implement ISA Logic/Circuit Design: gates and low-level circuits to implement components Process Engineering & Fabrication: develop and manufacture lowest-level components 1-25 Descriptions of Each Level Problem Statement stated using "natural language" may be ambiguous, imprecise Algorithm step-by-step procedure, guaranteed to finish definiteness, effective computability, finiteness Program express the algorithm using a computer language high-level language, low-level language Instruction Set Architecture (ISA) specifies the set of instructions the computer can perform data types, addressing mode

14 Descriptions of Each Level (cont.) Microarchitecture detailed organization of a processor implementation different implementations of a single ISA Logic Circuits combine basic operations to realize microarchitecture many different ways to implement a single function (e.g., addition) Devices properties of materials, manufacturability 1-27 Many Choices at Each Level Solve a system of equations Red-black SOR Gaussian elimination Jacobi iteration Multigrid FORTRAN C C++ Java PowerPC Intel x86 Atmel AVR Centrino Pentium 4 Xeon Tradeoffs: cost performance power (etc.) Ripple-carry adder Carry-lookahead adder CMOS Bipolar GaAs

15 Course Outline Bits and Bytes How do we represent information using electrical signals? Digital Logic How do we build circuits to process information? Processor and Instruction Set How do we build a processor out of logic elements? What operations (instructions) will we implement? Assembly Language Programming How do we use processor instructions to implement algorithms? How do we write modular, reusable code? (subroutines) I/O, Traps, and Interrupts How does processor communicate with outside world? C Programming How do we write programs in C? How do we implement high-level programming constructs? 1-29 Midterms, Homeworks and Grading Grading breakdown 1. Homeworks (5) 20% 2. Programming Assignments (4-5) 30% 3. Midterm (90 minutes) 25% 4. Final (90 minutes) 25% Late Submission Policy: Upto 2 days late for 50% of grade Academic Dishonesty: We really don t expect it to happen Please don t disappoint us