Short Term Scheduler and Dispatcher
Lecture 14 of CS604 Operating Systems establishes the theoretical and operational framework of CPU scheduling. Process execution alternates between CPU burst phases of computation and I/O burst phases awaiting data transfers. The short-term scheduler selects an executable process from the ready queue whenever the CPU becomes idle. The lecture contrasts non-preemptive scheduling, where a process retains the CPU until it terminates or enters a waiting state, with preemptive scheduling, where the kernel can forcibly interrupt a running process. The function of the Dispatcher is demystified, focusing on context switching, switching to user mode, and jumping to the proper location in the user program, with special attention to dispatch latency overhead. The lecture establishes five quantitative scheduling criteria: CPU utilization, throughput, turnaround time, waiting time, and response time. Reviewing the accompanying lecture handouts and memory diagrams reinforces understanding of virtual memory paging, address translation, and page tables. Consistent evaluation of scheduling Gantt charts, burst equations, and queue structures ensures robust preparation for academic assessments. Students investigate the role of inter-process communication channels in coordinating cooperating processes across user and kernel address spaces. The discussion highlights how hardware atomic instructions such as Test-and-Set and Swap provide the foundation for mutual exclusion primitives. Key concepts such as Peterson's algorithm, counting semaphores, and monitor condition variables are thoroughly demystified. The lecture details classical synchronization problems including the bounded-buffer, readers-writers, and dining philosophers scenarios. Structured deadlock avoidance methodologies are demonstrated using Dijkstra's Banker's Algorithm and Resource Allocation Graphs. Memory placement strategies including first-fit, best-fit, and worst-fit are evaluated alongside external fragmentation and compaction techniques. Paging architectures are explored through translation lookaside buffers, multi-level page tables, and inverted page table organizations. Virtual memory demand paging mechanics, page fault exception traps, and lazy swapping policies are systematically analyzed. Page replacement policies including First-In First-Out, Least Recently Used, and the Second-Chance Clock algorithm are evaluated for efficiency. Scholars examine thrashing phenomena, the working set model, and page-fault frequency controls to maintain optimal system throughput.
No questions available yet.
There are currently no examination questions published for Short Term Scheduler and Dispatcher. Explore other curriculum units or build a custom quiz with the practice builder.