MIT · Computer Science
6.004 Computation Structures
Chris Terman · 2017 · 170 free video lectures
This course introduces architecture of digital systems, emphasizing structural principles common to a wide range of technologies. It covers the topics including multilevel implementation strategies, definition of new primitives (e.g., gates, instructions, procedures, processes) and their…
▶ Play on Open Lecture HallCourse page ↗
Lectures
- What is information? (2:16)
- Concrete Encoding of Information (4:16)
- MOSFET: Physical View (7:59)
- Sum of Products (9:38)
- Digital State (10:05)
- Finite State Machines (5:56)
- Latency and Throughput (6:17)
- Power Dissipation (11:48)
- Datapaths and FSMs (5:17)
- Intro to Assembly Language (8:13)
- Intepretation and Compilation (9:36)
- Procedures (10:04)
- Building Blocks (10:13)
- Memory Technologies (4:16)
- Improving Beta Performance
- Associative Caches (9:32)
- CMOS Timing (10:03)
- Compiling Expressions (8:34)
- Compiling a Procedure (4:45)
- D Register Timing (5:46)
- Deadlock
- Example: Match Handler with OS (5:23)
- Exceptions (6:04)
- Handling Illegal Instructions
- Instruction-level Parallelism
- Jumps and Branches (7:46)
- Karnaugh Maps (10:57)
- Load and Store (4:34)
- MMU Improvements
- Page Faults
- Processes
- Synchronization and Metastability (9:52)
- System-level Interconnect
- The von Neumann Model (10:29)
- VTC Example (2:18)
- Wires
- Worked Example: A Better Beta
- Worked Example: Caches
- Worked Example: Combinational Logic Timing
- Worked Example: Compilers
- Worked Example: FSM Implementation
- Worked Example: Karnaugh Maps
- Worked Example: Latch Implementation
- Worked Example: Operating Systems
- Worked Example: Pipelining
- Worked Example: Procedures and Stacks
- Worked Example: Programmable Architectures
- Worked Example: Semaphores
- Worked Example: Sequential Logic Timing
- Worked Example: The Static Discipline
- Worked Example: Two's Complement Representation
- ALU Instructions (7:00)
- Activation Records and Stacks (8:41)
- Atomic Transactions
- Basics of Virtual Memory
- Carry-lookahead Adders (5:19)
- Computability, Universality (6:01)
- Data Hazards
- Models of Computation (6:12)
- Optimization and Code Generation (8:23)
- Pipelining Methodology (5:59)
- Point-to-point Communication
- Semaphore Implementation (4:16)
- Sequential Circuit Timing (6:52)
- Stack Frame Organization (5:49)
- Storage (6:37)
- The Locality Principle (7:12)
- Timesharing
- Worked Example: CMOS Functions
- Worked Example: Cache Benefits
- Worked Example: Error Correction
- Worked Example: FSM States and Transitions
- Worked Example: Two's Complement Addition
- Write Strategies (4:16)
- Building the MMU
- CMOS Gates (3:40)
- Caches (5:54)
- Carry-select Adders (5:40)
- Constant Operands (5:29)
- Control Hazards
- Control Structures (2:16)
- Direct-mapped Caches (7:09)
- Encoding (3:49)
- Error Detection (5:09)
- Instruction Macros (7:39)
- Lenient Gates (4:21)
- Multiplier Tradeoffs (5:13)
- OS Device Handlers
- Stack Detective (5:57)
- Symbols and Labels (4:24)
- System-level Interfaces
- Thread-level Parallelism
- Worked Example: CMOS Logic Gates
- Worked Example: Truth Tables
- ALU Instructions (6:57)
- Analog Signaling (7:20)
- Assembly Wrap-up (4:44)
- Basic 5-Stage Pipeline
- Beta Junkyard
- Branches (6:19)
- Compiler Frontend (4:32)
- Compiling Statements (3.53)
- Contexts
- D Register (5:06)
- Exceptions and Interrupts
- Fixed-length Encodings (5:51)
- Inverting Logic (7:26)
- MOSFET: Electrical View (8:10)
- Pipelining Summary
- Programmable Datapaths (4:50)
- Read-only Memories (5:38)
- Real Time (5:47)
- Recap: Virtual Memory
- SRAM (6:58)
- Variable-length Encoding (3:40)
- Worked Example: Gates and Boolean Logic
- Worked Example: Huffman Encoding
- 6.004 Wrap-up
- Buses
- Cache Coherence
- D Latch (6:12)
- Data-level Parallelism
- Equivalent States; Implementation (6:03)
- Example: Priorities in Action!
- Logic Simplification (5:00)
- Pipelined Circuits (6:11)
- Roboant Example (5:33)
- Self-timed Circuits (6:21)
- Shared Memory & Caches
- Strong Priorities (7:56)
- Supervisor Calls
- Voltage Transfer Characteristic (5:06)
- Worked Example: Devices and Interrupts
- Worked Example: Pipelining 2
- Beyond Inverters (5:29)
- CMOS Recipe (5:15)
- Combinational Devices (6:06)
- Communication Topologies (6:28)
- Huffman Code (1:20)
- Interprocess Communication
- Jumps (3:24)
- Memory Access (2:56)
- Multiplexers (3:14)
- Part 1 Wrap-up (3:02)
- Pipelined Beta
- Semaphores (7:31)
- Summary (3:42)
- Useful Logic Gates (5:56)
- Weak Priorities (5:10)
- Circuit Interleaving (7:08)
- Dealing with Noise (4:20)
- Even More Memory Hierarchy
- Huffman's Algorithm (2:09)
- Quantifying Information (5:22)
- Signed Integers: 2's complement (4:34)
- Timing Example (3:28)
- Uncomputable Functions (2:57)
- Binary Multiplication (6:03)
- Block Size; Cache Conflicts (6:04)
- Entropy (2:49)
- Error Correction (1:34)
- FSM States (3:45)
- SVCs for Input/Output (8:52)
- DRAM (5:10)
- Using Voltages Digitally (4:28)
- Worked Example: Virtual Memory
- Non-volatile Storage; Using the Hierarchy (8:43)
- State Transition Diagrams (11:18)
- Worked Example: Beta Assembly
- Worked Example: Beta Control Signals
From MIT OpenCourseWare · CC BY-NC-SA 4.0. More from MIT.
Open Lecture Hall is free, with no ads and no sign-up. It is not run by or connected to any university; the lectures are the universities' own free recordings, played from where they host them. About & rights