Course Curriculum
Total learning: 55 lessons
- Scheduling Algorithms 9
- Scheduling Algorithms : Introduction, Basic Terminologies.Lecture1.1
- First Come First Serve (FCFS) : Introduction , ExampleLecture1.2
- First Come First Serve (FCFS) : Example.Lecture1.3
- Shortest Job First Scheduling AlgorithmLecture1.4
- Shortest Remaining Time First Scheduling AlgorithmLecture1.5
- Priority Based Scheduling Algorithms : Non-PreemptiveLecture1.6
- Priority Based Scheduling Algorithms : PreemptiveLecture1.7
- Highest Response Ration Next Scheduling AlgorithmLecture1.8
- Round Robin Scheduling AlgorithmLecture1.9
- InterProcess Communication (IPC) - Synchronization. 15
- IntroductionLecture2.1
- Producer Consumer Problem with busy waiting.Lecture2.2
- Producer Consumer Problem – Lack of Synchronization.Lecture2.3
- Producer Consumer Problem Without busy waiting – Blocking (Sleeping).Lecture2.4
- Requirements of Synchronization.Lecture2.5
- Terminologies : Critical Section, Race Condition, Pre-emption, Mutual Exclusion.Lecture2.6
- Synchronization Mechanism 1 : Desabling Interrupts.Lecture2.7
- Synchronization Mechanism 2 : Lock Variable.Lecture2.8
- Binary Semaphores : Down() and Up().Lecture2.9
- Synchronization Mechanism 3 : Strict Alternation.Lecture2.10
- Semaphores Introduction : Counting Semaphores and Counting Semaphores.Lecture2.11
- Counting Semaphores : Down() and Up().Lecture2.12
- Four cases of Binary Semaphores.Lecture2.13
- Readers – Writers Problem with Semaphore.Lecture2.14
- Producer Consumer Problem with SemaphoresLecture2.15
- Deadlocks 9
- Necessary Conditions for Ocurring deadlock.Lecture3.1
- Deadlock Prevention : Breaking one of necessary Conditions.Lecture3.2
- Introduction, DefinitionsLecture3.3
- Strategies for Deadlock Handling.Lecture3.4
- Resource Allocation Graph(RAG)Lecture3.5
- Deadlock Avoidance : Bankers AlgorithmLecture3.6
- Deadlock Avoidance : Introduction.Lecture3.7
- Deadlock Avoidance : Bankers Algorithm – Single Instance – ExampleLecture3.8
- Deadlock Avoidance : Bankers Algorithm – Multiple Instance – ExampleLecture3.9
- Memory Management Unit 22
- Introduction, Basics, Memory Structure.Lecture4.1
- Memory Specification : Words, Bytes, BitsLecture4.2
- RAM Chip Organization.Lecture4.3
- Creating Big memory with small size memory chips.Lecture4.4
- Examples : Building Bigger memory with small size chips.Lecture4.5
- Memory Manager : Functions and Goals.Lecture4.6
- Memory management Techniques: Contiguous and Non-Contiguous memory.Lecture4.7
- Contiguous Memory Allocation : OverlaysLecture4.8
- Non-Contiguous Memory Allocation : IntroductionLecture4.9
- Pysical Address Space (PAS) and Logical Address Space (LAS).Lecture4.10
- Architecture : PAS, LAS, LA and PA.Lecture4.11
- Paging : Organization of Logical Address SpaceLecture4.12
- Paging : Organization of Physical Address SpaceLecture4.13
- Paging : Address Translation – Logical Address to Physical Address.Lecture4.14
- Paging : Numerical Problem 1Lecture4.15
- Paging : Organization fo MMU – Page Table.Lecture4.16
- Paging : Numerical Problem 2Lecture4.17
- Performance of pagingLecture4.18
- Translation Look Ahead Buffer (TLB).Lecture4.19
- Optimal Page SizeLecture4.20
- Multilevel PagingLecture4.21
- Multilevel Paging : Performance with TLBLecture4.22
This content is protected, please login and enroll course to view this content!
Multilevel Paging
Prev