MIT OpenCourseWare

MIT OpenCourseWare
5,896 videos, +2,320,000 subscribers

Find video
preview 1 2 3 4 5 6 7 8 9 10 11 next [+10]
	name	time	views
	9.2.4 Storage	6:38	166
	2.2.2 Analog Signaling	7:20	364
	13.2.5 Exceptions	6:50	93
	20.2.6 Communication Topologies	6:28	152
	1.2.6 Signed Integers: 2's complement	4:34	520
	9.2.9 Jumps	3:25	84
	7.2.1 Latency and Throughput	6:17	214
	6.2.1 Finite State Machines	5:56	255
	18.2.2 SVCs for Input/Output	8:53	72
	21.2.4 Shared Memory & Caches	5:51	127
	18.2.4 Real Time	5:48	70
	8.2.1 Power Dissipation	11:49	126
	16.2.6 MMU Improvements	7:34	51
	6.2.2 State Transition Diagrams	11:19	183
	1.2.9 Huffman Code	1:20	375
	20.2.4 Point-to-point Communication	6:47	65
	5.2.6 Timing Example	3:29	105
	21.2.2 Data-level Parallelism	6:45	162
	17.2.5 Supevisor Calls	6:52	52
	6.2.5 Equivalent States; Implementation	6:40	99
	17.2.2 Processes	8:36	87
	3.2.5 CMOS Gates	3:41	169
	14.2.6 Caches	5:55	89
	19.2.2 Semaphores	7:32	147
	3.2.3 CMOS Recipe	5:16	171
	12.2.1 Procedures	10:40	86
	2.2.6 Voltage Transfer Characteristic	5:60	229
	16.2.2 Basics of Virtual Memory	12:20	106
	5.2.2 D Latch	6:12	170
	11.2.4 Compiler Frontend	4:33	123
	7.2.3 Pipelining Methodology	5:59	87
	13.2.2 ALU Instructions	7:10	93
	18.2.6 Strong Priorities	7:57	36
	4.2.3 Inverting Logic	7:26	182
	3.2.7 Lenient Gates	4:22	109
	21.2.5 Cache Coherence	9:31	68
	16.2.3 Page Faults	6:48	49
	8.2.4 Binary Multiplication	6:30	120
	9.2.2 Programmable Datapaths	4:57	89
	11.2.3 Compiling Statements	3:54	56
	7.2.2 Pipelined Circuits	6:12	79
	20.2.5 System-level Interconnect	3:57	52
	16.2.1 Even More Memory Hierarchy	7:10	59
	10.2.6 Computability, Universality	6:22	55
	12.2.3 Stack Frame Organization	5:49	114
	15.2.4 Control Hazards	11:26	55
	8.2.2 Carry-select Adders	5:41	569
	14.2.2 SRAM	6:59	78
	21.2.1 Instruction-level Parallelism	13:58	333
	19.2.4 Semaphore Implementation	4:17	82
	13.2.3 Load and Store	4:35	96
	4.2.5 Karnaugh Maps	10:58	198
	14.2.1 Memory Technologies	4:17	82
	18.2.1 OS Device Handlers	6:80	54
	19.2.3 Atomic Transactions	8:26	70
	20.2.2 Wires	9:43	69
	5.2.5 Sequential Circuit Timing	6:52	110
	10.2.2 Symbols and Labels	4:25	59
	4.2.1 Sum of Products	9:38	168
	12.2.4 Compiling a Procedure	4:45	51
	2.2.5 Dealing with Noise	4:20	192
	6.2.6 Synchronization and Metastability	9:52	187
	11.2.1 Iterpretation and Compilation	9:36	93
	7.2.4 Circuit Interleaving	7:90	64
	8.2.6 Part 1 Wrap-up	3:30	44
	7.2.5 Self-timed Circuits	6:22	66
	21.2.6 6.004 Wrap-up	5:44	63
	9.2.5 ALU Instructions	6:58	81
	20.2.3 Buses	4:55	61
	15.2.1 Improving Beta Performance	9:51	36
	10.2.8 Worked Examples: Beta Assembly	7:50	47
	11.2.6 Worked Examples	9:29	46
	19.2.5 Deadlock	7:37	114
	3.2.6 CMOS Timing	10:40	149
	10.2.1 Intro to Assembly Language	8:13	211
	16.2.4 Building the MMU	10:17	43
	14.2.10 Write Strategies	4:42	57
	13.2.7 Worked Examples: A Better Beta	9:40	38
	4.2.7 Read-only Memories	5:39	179
	4.2.8 Worked Examples: Truth Tables	4:47	104
	3.2.8 Worked Examples: CMOS Functions	1:47	89
	15.2.5 Exceptions and Interrupts	5:19	49
	7.2.6 Control Structures	2:16	56
	14.2.9 Associative Caches	9:33	47
	4.2.8 Worked Examples: Karnaugh Maps	3:39	92
	3.2.2 MOSFET: Electrical View	8:11	210
	9.2.7 Memory Access	2:57	65
	13.2.1 Building Blocks	10:14	52
	8.2.3 Carry-lookahead Adders	5:19	138
	14.2.3 DRAM	5:11	83
	6.2.4 Roboant Example	5:34	104
	2.2.3 Using Voltages Digitally	4:28	200
	7.2.7 Worked Examples: Pipelining 2	6:13	53
	15.2.6 Pipelining Summary	1:56	153
	5.2.4 D Register Timing	5:46	108
	1.2.10 Error Detection and Correction	5:90	304
	20.2.1 System-level Interfaces	7:42	41
	14.2.5 The Locality Principle	7:13	54
	17.2.6 Worked Examples: Operating Systems	7:16	44
	14.2.8 Block Size; Cache Conflicts	6:50	56
preview 1 2 3 4 5 6 7 8 9 10 11 next [+10]

MIT OpenCourseWare 5,896 videos, +2,320,000 subscribers

MIT OpenCourseWare
5,896 videos, +2,320,000 subscribers