Lecture

Scheduling

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

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.

Official source

Ontological neighbourhood

Computer engineering

High-performance computing: Real-time computing

Related concepts (32)

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.

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.

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.

Rate-monotonic scheduling

In computer science, rate-monotonic scheduling (RMS) is a priority assignment algorithm used in real-time operating systems (RTOS) with a static-priority scheduling class. The static priorities are assigned according to the cycle duration of the job, so a shorter cycle duration results in a higher job priority. These operating systems are generally preemptive and have deterministic guarantees with regard to response times. Rate monotonic analysis is used in conjunction with those systems to provide scheduling guarantees for a particular application.

Related lectures (64)

Process Protection and Efficient Execution

Explores process execution, protection, and efficient OS mechanisms for secure and reliable multi-program environments.

Traps and Interrupts: Mechanisms for Operating System Control

Explains traps, interrupts, and exceptions, detailing their roles in operating system control and process management.

Embedded Systems: Control Basics

Introduces control basics, real-time programming, interrupts, and sensor networks in embedded systems, emphasizing resource management and real-time constraints.

IO Devices: Interaction and Performance

Covers the interaction between operating systems and IO devices, focusing on hardware fundamentals and performance implications.

Scheduling Mechanisms: Context Switching and Policies