Differences

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

--- lecture_notes [2012/03/13 15:06] – hj
+++ lecture_notes [2012/04/24 15:59] (current) – hj
@@ Line 1: / Line 1: @@
 ====== Lecture notes ======
-  * Week 1-2: ({{:cse3221_w12_w1_p3_new.pdf|3-slide/page}}, {{:cse3221_w12_w1_p6_new.pdf|6-slide/page}}, {{:cse3221-f12-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  ({{:cse3221z_w12_w3_p3.pdf|3-slide/page}}, {{:cse3221z_w12_w3_p6.pdf|6-slide/page}}, {{:cse3221z_w12_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 ({{:cse3221_w12_w4_p3.pdf|3-slide/page}}, {{:cse3221_w12_w4_p6.pdf|6-slide/page}}, {{:cse3221_w12_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 ({{:cse3221_w12_w5_p3.pdf|3-side/page}}, {{:cse3221_w12_w5_p6.pdf|6-slide/page}}, {{:cse3221_w12_w5_p2.pdf|2-slide/page}}) – CPU scheduling: criteria, algorithm, implementation. (chapter 5)
+  * Week 5 (3-side/page, 6-slide/page, 2-slide/page) – CPU scheduling: criteria, algorithm, implementation. (chapter 5)
-  * Week 6 ({{:cse3221_w12_w6_p3.pdf|3-side/page}}, {{:cse3221_w12_w6_p6.pdf|6-slide/page}}, {{:cse3221_w12_w6_p2.pdf|2-slide/page}}) – Process Synchronization (I): critical-section problem & example, bakery algorithm, Peterson’s solution. (chapter 6.1-6.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 6.1-6.3)
-  * Week 7 ({{:cse3221_w7_p3.pdf|3-side/page}}, {{:cse3221_w7_p6.pdf|6-slide/page}}, {{:cse3221_w7_p2.pdf|2-slide/page}}) - Process Synchronization (II): hardware solution, semaphore, classic problems (B-B, R-W, D-P). (chapter 6.4-6.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 6.4-6.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)
+  * 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)
-  * Week 10 (3-side/page, 6-slide/page, 2-slide/page) - Memory Management (II): paging, segmentation, examples. (chapter 8.4 -8.8)
+  * Week 9 (3-side/page, 6-slide/page,2-slide/page) - Memory Management (II): paging, segmentation, examples. (chapter 8.4 -8.8)
-  * Week 11 (3-side/page, 6-slide/page, 2-slide/page) – Virtual Memory: demand paging, replacement, thrashing. (chapter 9)
+  * Week 10 (3-side/page, 6-slide/page, 2-slide/page) – Virtual Memory: demand paging, replacement, thrashing. (chapter 9)
-  * Week 12 (3-side/page, 6-slide/page, 2-slide/page) – Protection and Security. (chapter 14-15)
+  * Week 11 (3-side/page, 6-slide/page, 2-slide/page) – Protection and Security. (chapter 14-15)