Where: Moore B03 When: MWF 11:15-12:25 X-Hour: Tuesday 12:00

Luiz Felipe Perrone, Sudikoff 209 Cybersecurity Research Group ISTS Dartmouth College

1.1

Administrivia
1) We have a webpage:
http://www.cs.dartmouth.edu/~cs37 (syllabus, slides, readings, and all administrivia)

2) TAs: Clint Hepner and Ming Li 3) Office Hours 4) Textbook: one required plus another two for who really wants more. 5) X-Hours: I just cant get enough.
1.2

Administrivia
6) Honor Principle: read it, abide by it. 7) Grades: QZ = 6%, MT = 20%, FE = 24%, HW = 49%
QZ =
3 i =1

qzi

HW =

7 i =1

hwi

g = QZ + MT + FE + HW

g
Final grade:

No paper, bad paper B paper A paper

1.3

g*1.025 g *1.05

Lecture 1
Abstraction Layers Where Bits Are Born

1.4

Layers of Abstraction
abstraction: the act or process of abstracting. abstracting: to make an abstract of , to summarize. Think about how you interact with the world: You dont constantly think about all the details in everything around you. You think about essentials. You deal with function blocks and interfaces.
1.5

Layers of Abstraction
Points to consider: 1) Give something an input and get something from it as output. Its the functionality that matters. 2) When we can conceptually break down a system into cooperating components, the interface between components must be well understood.
1.6

Layers of Abstraction

domain

function

range
1.7

Layers of Abstraction
program domain computer

output data

input data

f()

range

1.8

Interlude: Alan Turing, Founder of Computer Science

1912 (23 June): Birth, Paddington, London 1931-34: Undergraduate at King's College, Cambridge University 1932-35: Studies quantum mechanics, probability, logic 1936: The Turing machine: On Computable Numbers... submitted 1936-38: At Princeton University. Ph.D. Papers in logic, algebra, number theory 1938-39: Return to Cambridge. Introduced to German Enigma cipher problem 1939-40 Devises the Bombe, machine for Enigma decryption 1939-42: Breaking of U-boat Enigma cipher, saving battle of the Atlantic 1943-45: Chief Anglo-American consultant. Introduced to electronics 1946: Computer design, leading the world, formally accepted 1947-48: Papers on programming, neural nets, and prospects for artificial intelligence 1949: Work on programming and world's first serious use of a computer 1950: Philosophical paper on machine intelligence: the Turing Test 1952: Arrested and tried as a homosexual, loss of security clearance 1954 (7 June): Death by cyanide poisoning, Wilmslow, Cheshire.

data program Turing Machine

1.9

Layers of Abstraction
Application System Software Hardware
Compilers, web browsers, word processors, MP3 players, etc. I/O device control, process scheduling, virtual memory, file system, etc. Arithmetic operations, data transfer, memory, mass storage, etc.

Abstractions: serve to hide detail behind functionality, you concentrate on what you must, allow for a good measure of flexibility.
1.10

10

Layers of Abstraction
Application System Software Functional Components
Logic Gates Hardware Discrete Electronic Components
Bus,CPU,Memory

AND,OR,NOT,

transistor, capacitor, resistor,

"!        

1.11

11

Why stoop that low?

Understand how one implements a high-level language (compiler construction). Understand how an operating system is constructed. Understand how one designs a low level language: the processors instruction set. Understand what you [can] get from a processor (performance). Understand how to better control the computer so you can get the maximum it can give you. Understand your system choices.
1.12

12

Switch: The Basic Building Block

When the switch is open, current cannot flow. When the switch is closed, current can flow from the source to the ground.

V0 has the same

potential as the source.

V0 has the same potential

as the ground.

1.13

13

Information Representation
The switch has two possible states:
potential (V)
+5 V
1

surely 1
uncertainty zone

surely 0
0

BINARY SYSTEM

Question: Is this system too restrictive?

1.14

14

What you can do with switches

(1) (3) (2)

1.15

15

What you cant do with switches

You cant control them electronically.
You dont want to have to mechanically set A and B (push them with your fingers) when you want to compute a function. What you do want is to be able to set their values with an electric signal

1.16

16

Mechanical Limitation
V0
Can read the output value from this point on

input

output

time
During this time the output value is meaningless
1.17

17

Switch: The Basic Building Block

When current in injected from the base, current can flow from the collector to the emitter.
emitter

collector base

V0 will have the same

potential as ground.

1.18

18

The Not Function with a Transistor

Vo
0V +5V

Vi
+5V 0V

1.19

19

The Not Function with a Logic Gate

output input variable variable

A 0 1

B 1 0

From discrete components to logic gates: our first move up toward a higher layer of abstraction.

Truth table
1.20

20

Interlude: Another Lower Layer?

Functional Components Logic Gates Discrete Electronic Components

bitstrings bits electric currents

Discrete Spintronic Components

electrons spins

1.21

21

Putting Information in Electrons States

Use electron spin (angular momentum) to represent binary values: {down, up} = {0, 1} 0 + = 0 1 5 bits 1 0

A qubit differs from a bit in that it can assume a superposition of states: they can be both 0 and 1 simultaneously.

All possible values at once:

25
1.22

22

Advantages of Spintronics
Spin doesnt change when devices are powered off: we can have nicer memories built with this technology. Consume less power. Incredibly faster computation. More integration.

1.23

23

The Challenge in Spintronics

When a qubit interacts with the surrounding, its value is converted to a random bit. To read the value of a qubit, you need to interact with it While quantum computing is a far-off goal, spintronics may allow for vast improvements when combined with conventional semiconductor technology.

1.24

24