Differences

This shows you the differences between two versions of the page.

--- lecture_notes [2018/11/08 16:57] – hj
+++ lecture_notes [2019/03/25 22:42] (current) – hj
@@ Line 1: / Line 1: @@
 ====== Lecture notes ======
-  * Week 1-2: ({{:eecs3221_f18_w1_p3.pdf|3-slide/page}}, {{:eecs3221_f18_w1_p6.pdf|6-slide/page}}, {{:eecs3221_f18_w1_p2.pdf|2-slide/page}}) – Introduction: multiprogramming, multitasking, interrupt-driven, kernel, system calls, etc.  (chapters 1,2)
+  * Week 1-2: (3-slide/page, 6-slide/page, 2-slide/page) – Introduction: multiprogramming, multitasking, interrupt-driven, kernel, system calls, etc.  (chapters 1,2)
-  * Week 3  ({{:eecs3221e-f18-w3-p3.pdf|3-slide/page}}, {{:eecs3221e-f18-w3-p6.pdf|6-slide/page}}, {{:eecs3221e-f18-w3-p2.pdf|2-slide/page}}) – Process: concept, PCB, context switch, Inter-Process Communication (IPC), Unix programming (signals, pipes).  (chapter 3)
+  * Week 3  (3-slide/page, 6-slide/page, 2-slide/page) – Process: concept, PCB, context switch, Inter-Process Communication (IPC), Unix programming (signals, pipes).  (chapter 3)
-  * Week 4 ({{:eecs3221e-f18-w4-p3.pdf|3-slide/page}}, {{:eecs3221e-f18-w4-p6.pdf|6-slide/page}}, {{:eecs3221e-f18-w4-p2.pdf|2-slide/page}}) – Thread: concept (vs process), thread models, multithreaded programming (Pthreads). (Chapter 4)
+  * Week 4 (3-slide/page, 6-slide/page, 2-slide/page) – Thread: concept (vs process), thread models, multithreaded programming (Pthreads). (Chapter 4)
-  * Week 5 ({{:eecs3221-f18-w5-p3.pdf|3-side/page}}, {{:eecs3221-f18-w5-p6.pdf|6-slide/page}}, {{:eecs3221-f18-w5-p2.pdf|2-slide/page}}) – CPU scheduling: criteria, algorithm, implementation. (chapter 6)
+  * Week 5 (3-side/page, 6-slide/page, 2-slide/page) – CPU scheduling: criteria, algorithm, implementation. (chapter 6)
-  * Week 6 ({{:eecs3221-f18-w6-p3.pdf|3-side/page}}, {{:eecs3221-f18-w6-p6.pdf|6-slide/page}}, {{:eecs3221-f18-w6-p2.pdf|2-slide/page}}) – Process Synchronization (I): critical-section problem & example, bakery algorithm, Peterson’s solution. (chapter 5.1-5.3)
+  * Week 6 (3-side/page, 6-slide/page, 2-slide/page) – Process Synchronization (I): critical-section problem & example, bakery algorithm, Peterson’s solution. (chapter 5.1-5.3)
-  * Week 7 ({{:eecs3221-f18-w7-p3.pdf|3-side/page}}, {{:eecs3221-f18-w7-p6.pdf|6-slide/page}}, {{:eecs3221-f18-w7-p6.pdf|2-slide/page}}) - Process Synchronization (II): hardware solution, semaphore, classic problems (B-B, R-W, D-P). (chapter 5.4-5.8)
+  * Week 7 (3-side/page, 6-slide/page, 2-slide/page) - Process Synchronization (II): hardware solution, semaphore, classic problems (B-B, R-W, D-P). (chapter 5.4-5.8)
   * Week 8 (3-side/page, 6-slide/page, 2-slide/page) – Memory Management (I): logical vs. physical memory, address binding; Contiguous memory allocation. (chapter 8.1-8.3)