Scheduling Algorithms
  • Scheduling Algorithms : Introduction, Basic Terminologies.
  • First Come First Serve (FCFS) : Introduction , Example
  • First Come First Serve (FCFS) : Example.
  • Shortest Job First Scheduling Algorithm
  • Shortest Remaining Time First Scheduling Algorithm
  • Priority Based Scheduling Algorithms : Non-Preemptive
  • Priority Based Scheduling Algorithms : Preemptive
  • Highest Response Ration Next Scheduling Algorithm
  • Round Robin Scheduling Algorithm
InterProcess Communication (IPC) - Synchronization.
  • Introduction
  • Producer Consumer Problem with busy waiting.
  • Producer Consumer Problem - Lack of Synchronization.
  • Producer Consumer Problem Without busy waiting - Blocking (Sleeping).
  • Terminologies : Critical Section, Race Condition, Pre-emption, Mutual Exclusion.
  • Requirements of Synchronization.
  • Synchronization Mechanism 1 : Desabling Interrupts.
  • Synchronization Mechanism 2 : Lock Variable.
  • Synchronization Mechanism 3 : Strict Alternation.
  • Semaphores Introduction : Counting Semaphores and Counting Semaphores.
  • Counting Semaphores : Down() and Up().
  • Binary Semaphores : Down() and Up().
  • Four cases of Binary Semaphores.
  • Producer Consumer Problem with Semaphores
  • Readers - Writers Problem with Semaphore.
Deadlocks
  • Introduction, Definitions
  • Necessary Conditions for Occurring deadlock.
  • Resource Allocation Graph(RAG)
  • Strategies for Deadlock Handling.
  • Deadlock Prevention : Breaking one of necessary Conditions.
  • Deadlock Avoidance : Introduction.
  • Deadlock Avoidance : Bankers Algorithm
  • Deadlock Avoidance : Bankers Algorithm - Single Instance - Example
  • Deadlock Avoidance : Bankers Algorithm - Multiple Instance - Example
Memory Management Unit
  • Introduction, Basics, Memory Structure.
  • Memory Specification : Words, Bytes, Bits
  • RAM Chip Organization.
  • Creating Big memory with small size memory chips.
  • Examples : Building Bigger memory with small size chips.
  • Memory Manager : Functions and Goals.
  • Memory management Techniques: Contiguous and Non-Contiguous memory.
  • Contiguous Memory Allocation : Overlays
  • Non-Contiguous Memory Allocation : Introduction
  • Physical Address Space (PAS) and Logical Address Space (LAS).
  • Architecture : PAS, LAS, LA and PA.
  • Paging : Organization of Logical Address Space
  • Paging : Organization of Physical Address Space
  • Paging : Organization fo MMU - Page Table.
  • Paging : Address Translation - Logical Address to Physical Address.
  • Paging : Numerical Problem 1
  • Paging : Numerical Problem 2
  • Performance of paging
  • Translation Look Ahead Buffer (TLB).
  • Optimal Page Size
  • Multilevel Paging
  • Multilevel Paging : Performance with TLB