• course outline
• pointers in C (review?)

(The 12pm recording is missing the first part, but is available through Panopto via Canvas; the first part of the 2pm recording that covers what’s missing from the 12pm recording is also there.)

• .o, .a, .so files
• dynamic and static linking
• make
  • rules

• make (finish)

• user IDs/account abstraction
• POSIX permissions, briefly
• set-user-ID, sudo is not kernel mode

• kernel mode
• system calls
• memory protection

• non-system-call exceptions
  • timer interrupt
  • I/O

• context switches

• Unix signals
  • signal handlers and implementation

• Unix signals (con’t)
  • signal unsafety
  • handling signals without signal handlers

• processes, threads

• creating new processes
  • fork, exec*

(Reiss out of town)

(See Panopto on Canvas for videos; videos won’t be posted here for some time.)

• waiting for processes
• file descriptors

(Reiss out of town)

(See Panopto on Canvas for videos; videos won’t be posted here for some time.)

• dup2
• pipe, redirection

• virtual memory concept
  • address space and address sizes
• page tables
• loading data on demand (start)

• loading data on demand (finish)
• copy-on-write, other “page table tricks”
• storing page tables in memory (start)

• pagetable assignment
• as a tree

• multi-level lookup example

• caching idea
• memory hierarchy

• direct-mapped caches
  • valid bits, tags

• set-associative caches
• (briefly) replacement policies
• cache misses and C code (start)

• cache misses and C code (finish)
• cache write policies

• the TLB

• creating new threads

• thread use examples

• problem of synchronization

• problem of synchronziation
• locks and mutexes

• barriers

• deadlock
  • examples

• deadlock (con’t)
  • definition
  • preventing/avoiding
• producer/consumer problem
• monitors (start)

• monitors
• false sharing

• briefly, transactions

• layers
• mailbox analogy
  • best-effort delivery
  • envelope versus contents
• connections atop mailbox model
• names and addresses
• example: a frame
  • layers (link, network, transport)
• IP
  • addresses (v4, v6)
  • routers
• port numbers and UDP
• mapping between addresses and names/other addresses:
  • DNS

• NAT
• URLs

• DHCP

• cryptography (start)
  • symmetric encryption
  • asymmetric encryption
  • digital signature

• replay attacks
• public key infrastructure
• extra cryptography bits
  • cryptographic hashes
  • key exchange

• TLS protocol outline

• review: single-cycle CPU
• pipelining idea
• pipelining for the CPU
• pipelining tradeoffs
• hazards and hazard handling
  • stalling
  • branch prediction, briefly
  • forwarding

• combining forwarding and stalling

• some pipeline exercises

• idea of multiple issue + out-of-order
• (start) register renaming

• (finish) register renaming

• instruction queues, dispatch

• (if time) branch prediction ideas
  • static prediction
  • 1/2-bit histroy tables, pattern

• side chnanels generally
• side channels in the cache

• meltdown:
  • speculation past a priv/protection fault
• spectre
  • speculation past a bounds chcek
  • using cache side-channels

• reference sheet
• notes from 2pm section

Combined final time with other section.

7PM-10PM.

12:30pm section — Rice 130.

2pm section — Gilmer 301.