CS101 Lecture 25: The Machinery of Computation: Computer Architecture. John Magee 29 July 2013 Some material copyright Jones and Bartlett

Size: px

Start display at page:

Download "CS101 Lecture 25: The Machinery of Computation: Computer Architecture. John Magee 29 July 2013 Some material copyright Jones and Bartlett"

Myra Hall
5 years ago
Views:

1 CS101 Lecture 25: The Machinery of Computation: Computer Architecture John Magee 29 July 2013 Some material copyright Jones and Bartlett 1 Overview/Questions What did we do last time? Can we relate this circuit stuff to something we know something about? How can we combine these elements to do more complicated tasks? 2 1

2 What did we talk about last time? Circuits control the flow of electricity. Gates are simple logical systems. By combining several gates, we create logic-computing circuits. Logic-computing circuits can do binary number addition. 3 Integrated Circuits Integrated circuit (also called a chip) A piece of silicon on which multiple (many) gates have been embedded. Silicon pieces are mounted on a plastic or ceramic package with pins along the edges that can be soldered onto circuit boards or inserted into appropriate sockets 4 2

9 * 10 9 ) gate transistors on one chip.

3 Integrated Circuits 5 Central Processor Units The most important integrated circuit in any computer is the Central Processing Unit, or CPU. The Intel Duo Core 2 processor has more than 1.9 billion (1.9 * 10 9 ) gate transistors on one chip. The CPU combines many gates, to enable a small number of instructions. Examples: Add/subtract 2 binary inputs Load a value from memory Store a value into memory 6 3

edu/courses/cs101/labs/ecs_2e/applets/applets/binaryadd/applet_frame.

4 Recall Binary Number Addition Adding two 1-bit numbers together produces A sum bit A carry bit 7 Recall: The Full Adder The full adder takes 3 inputs: A, B, and a carry-in value Figure 4.10 A full adder 8 4

5 Here is the Full Adder, with its internal details hidden (an abstraction). The Full Adder What matters now are: inputs are A, B, and CI. outputs are S and CO 9 An 8-bit Adder To add two 8-bit numbers together, we need an 8-bit adder: Notice how the carry out from one bit s adder becomes the carry-in to the next adder. 10 5

6 An 8-bit Adder We can abstract away the 1-bit adders, And summarize with this diagram: Notice the inputs and outputs. 11 Output from the Adder The adder produces 2 outputs: Sum (multi-bit), Carry Out (1-bit) Where does the output go from here? Accumulator A circuit connected to an adder, which stores the adder s result. 12 6

7 Putting it Together The accumulator is a memory circuit, and is wired as both an output from the adder and an input back into the adder. 13 Accumulator Example Suppose we want to add 3 numbers: 1) Clear the accumulator (set to all 0s) 2) Load the first input into the adder 3) Compute the sum of accumulator + input 4) Result flows back into accumulator 5) Go to step 2 with next input 14 7

8 Input to the Adder The adder takes inputs A, B are two binary numbers (Carry-in should be 0) How do we feed numbers into the adder? Random Access Memory A large memory unit which stores data before/after processing. 15 Random Access Memory Memory cells are circuits which each hold a 1 bit value, grouped into 8-bit bytes. Each byte of memory has a unique address corresponding to its location within the circuit, so that it can be located. 8

9 Memory Memory Address A physical location in the computer s memory. Addressability The number of bits stored in each addressable location in memory. (A byte in our example.) Word Size The number of bits used in each memory address. This dictates how much physical memory can be addressed. Example: A 32-bit machine has 2 32 = 4,294,967,296 possible memory addresses. 17 Putting it together Input to the adder now comes from RAM. One issue we ll need to deal with: how to specify which data to fetch from RAM. 18 9

10 Putting it together Here s a more complete version, which takes another input for a memory address: 19 What about Subtraction? 2s complement Recall that binary subtraction is accomplished by adding the 2s complement of a number. Inverter A circuit built using NOT gates, which inverts all bits turning 1s into 0s and 0s into 1s. The inverter creates a 1s complement of its input. Adding 1 to this gives a 2s complement number, suitable for doing subtraction. (How could we add 1 to the inverted number?) 20 10

11 Putting it together Using an inverter, we can do addition and subtraction. Now we need a way to control the inverter. 21 From Adding Machine What we ve got is an machine that can do addition/subtraction in circuitry. It can read data from memory, and write data back to memory. We haven t dealt with how to: Specify from which address memory to read. Specify which operation to perform (add/subtract). Specify to which address to write

12 to Automatic Computer We need a way to tell the machine to: Load some data from memory (by address) into the adder. Perform Add or Subtract Store data from the accumulator into the memory (by address) What we need is a a way to program it. 23 Computer Programming, 0.X The earliest digital computers were programmed by wiring them up to perform some specific logic. Pictured: Harvard Mark I 24 12

Computer Programming, 0.X Later, instructions were programmed by flipping switches. Pictured: Digital Equipment PDP-8 Demo: http://www.youtube.com/watch?

13 Computer Programming, 0.X Later, instructions were programmed by flipping switches. Pictured: Digital Equipment PDP-8 Demo: 25 Stored Program Computer John von Neumann (a mathematician who worked on the atomic bomb) Described a computer architecture in which instructions are read from the memory space (RAM), just like data. This design enables programmability, by making it relatively easy to provide new instructions to the computer s hardware

14 Stored Program Computer (Von Neumann Architecture) Figure 5.1 The von Neumann architecture 27 Central Processing Unit Central Processing Unit (CPU) Refers to the combination of the Arithmetic/Logic Unit and the Control Unit. The ALU performs basic arithmetic operations and logic operations. Examples: Arithmetic: addition, subtraction, multiplication Logical operations: AND, OR, NOT, XOR 28 14

15 Central Processing Unit Central Processing Unit (CPU) Refers to the combination of the Arithmetic/Logic Unit and the Control Unit. The control unit coordinates the flow of operations and data in the computer. coordinates the ALU and memory Keeps track of which instruction to do in a Program Counter (PC) 29 Adder Inverter Accumulator Instructions Take-Away Points Von Neumann Architecture CPU: ALU/CU 30 15

16 Student To Dos Readings: Reed ch 7, pp HW posted on course schedule. Ask for help / visit TF hours. Wednesday Lab: Bring a headset or microphone if you have one. Most laptops have built-in microphones as well. Warning: Homework assignments can be very time consuming! 31 16

CS140 Lecture 03: The Machinery of Computation: Combinational Logic

CS140 Lecture 03: The Machinery of Computation: Combinational Logic John Magee 25 January 2017 Some material copyright Jones and Bartlett Some slides credit Aaron Stevens 1 Overview/Questions What did