Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Scheduling

Description

This lecture covers the fundamental concepts of scheduling in operating systems, including limited direct execution, protection rings, exceptions, interrupts, traps, context switching, preemptive scheduling, and various scheduling policies such as FIFO, SJF, STCF, RR, and MLFQ. The instructor explains the challenges of scheduling long-running batch processes and low-latency interactive processes, and introduces the concept of multi-level feedback queues to optimize for different metrics like turnaround time and response time.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Official source

Ontological neighbourhood

Computer engineering

High-performance computing: Real-time computing

Related concepts (32)

Preemption (computing)

In computing, preemption is the act of temporarily interrupting an executing task, with the intention of resuming it at a later time. This interrupt is done by an external scheduler with no assistance or cooperation from the task. This preemptive scheduler usually runs in the most privileged protection ring, meaning that interruption and then resumption are considered highly secure actions. Such changes to the currently executing task of a processor are known as context switching.

Scheduling (computing)

In computing, scheduling is the action of assigning resources to perform tasks. The resources may be processors, network links or expansion cards. The tasks may be threads, processes or data flows. The scheduling activity is carried out by a process called scheduler. Schedulers are often designed so as to keep all computer resources busy (as in load balancing), allow multiple users to share system resources effectively, or to achieve a target quality-of-service.

Interrupt

In digital computers, an interrupt (sometimes referred to as a trap) is a request for the processor to interrupt currently executing code (when permitted), so that the event can be processed in a timely manner. If the request is accepted, the processor will suspend its current activities, save its state, and execute a function called an interrupt handler (or an interrupt service routine, ISR) to deal with the event.

Interrupt handler

In computer systems programming, an interrupt handler, also known as an interrupt service routine or ISR, is a special block of code associated with a specific interrupt condition. Interrupt handlers are initiated by hardware interrupts, software interrupt instructions, or software exceptions, and are used for implementing device drivers or transitions between protected modes of operation, such as system calls. The traditional form of interrupt handler is the hardware interrupt handler.

Cooperative multitasking

Cooperative multitasking, also known as non-preemptive multitasking, is a style of computer multitasking in which the operating system never initiates a context switch from a running process to another process. Instead, in order to run multiple applications concurrently, processes voluntarily yield control periodically or when idle or logically blocked. This type of multitasking is called cooperative because all programs must cooperate for the scheduling scheme to work.

Related lectures (32)

MicroC/OS-II: Real-Time Kernel Overview

Provides an overview of MicroC/OS-II, a real-time kernel with multitasking capabilities and deterministic functions, covering topics such as task management, kernel, and intertask communication.

Parallel Port & Nios II Interrupts

Covers the design of a programmable parallel port interface for an Avalon bus and the architecture of the Nios II processor.

Nios II Interrupts

Explores the Nios II embedded system architecture, trade-off patterns, interrupt handling, exceptions, and ISR performance metrics.

RTOS: Scheduler Mechanisms and Semaphores

Explores RTOS scheduler mechanisms, semaphores, mutexes, and communication methods between tasks.

Playing Melodies: Timer & Interruption