Starting a new Lecture Notes Series on MIT 6.004 Computation Structures, Spring 2017
.png)
Youtube Lecture Playlist CreditsChannel Name: MIT OpenCourseWare
So Let Us Start to This Journey of Learning
MIT 6.004 Computation Structures, Spring 2017 By Lecture Notes together!
Lecture 61: 7.2.1 Latency and Throughput
Lecture 62: 7.2.2 Pipelined Circuits
Lecture 63: 7.2.3 Pipelining Methodology
Lecture 64: 7.2.4 Circuit Interleaving
Lecture 65: 7.2.5 Self-timed Circuits
Lecture 66: 7.2.6 Control Structures
Lecture 67: 7.2.7 Worked Examples: Pipelining
Lecture 68: 7.2.7 Worked Examples: Pipelining 2
Lecture 69: 8.2.1 Power Dissipation
Lecture 70: 8.2.2 Carry-select Adders
Lecture 71: 8.2.3 Carry-lookahead Adders
Lecture 72: 8.2.4 Binary Multiplication
Lecture 73: 8.2.5 Multiplier Tradeoffs
Lecture 74: 8.2.6 Part 1 Wrap-up
Lecture 75: 9.2.1 Datapaths and FSMs
Lecture 76: 9.2.2 Programmable Datapaths
Lecture 77: 9.2.3 The von Neumann Model
Lecture 78: 9.2.4 Storage
Lecture 79: 9.2.5 ALU Instructions
Lecture 80: 9.2.6 Constant Operands
Lecture 81: 9.2.7 Memory Access
Lecture 82: 9.2.8 Branches
Lecture 83: 9.2.9 Jumps
Lecture 85: 10.2.1 Intro to Assembly Language
Lecture 86: 10.2.2 Symbols and Labels
Lecture 87: 10.2.3 Instruction Macros
Lecture 88: 10.2.4 Assembly Wrap-up
Lecture 89: 10.2.5 Models of Computation
Lecture 90: 10.2.6 Computability, Universality
Lecture 91: 10.2.7 Uncomputable Functions
Lecture 92: 10.2.8 Worked Examples: Beta Assembly
Lecture 93: 11.2.1 Iterpretation and Compilation
Lecture 94: 11.2.2 Compiling Expressions
Lecture 95: 11.2.3 Compiling Statements
Lecture 96: 11.2.4 Compiler Frontend
Lecture 97: 11.2.5 Optimization and Code Generation
Lecture 98: 11.2.6 Worked Examples
Lecture 99: 12.2.1 Procedures
Lecture 100: 12.2.2 Activation Records and Stacks
Lecture 101: 12.2.3 Stack Frame Organization
Lecture 102: 12.2.4 Compiling a Procedure
Lecture 103: 12.2.5 Stack Detective
Lecture 104: 12.2.6 Worked Examples: Procedures and Stacks
Lecture 105: 13.2.1 Building Blocks
Lecture 106: 13.2.2 ALU Instructions
Lecture 107: 13.2.3 Load and Store
Lecture 108: 13.2.4 Jumps and Branches
Lecture 109: 13.2.5 Exceptions
Lecture 110: 13.2.6 Summary
Lecture 111: 13.2.7 Worked Examples: A Better Beta
Lecture 112: 13.2.7 Worked Examples: Beta Control Signals
Lecture 113: 14.2.1 Memory Technologies
Lecture 114: 14.2.2 SRAM
Lecture 115: 14.2.3 DRAM
Lecture 116: 14.2.4 Non-volatile Storage; Using the Hierarchy
Lecture 117: 14.2.5 The Locality Principle