Process Scheduling and Execution

These flashcards cover key concepts related to process scheduling, execution, and the various components and algorithms involved, based on the lecture notes.

CPU Scheduler

A component of the operating system that manages how processes use CPU resources and determines which of the ready processes will run next.

Preemption

The operation of interrupting an executing process to save its current context, allowing another process to be dispatched to the CPU.

Scheduling Algorithm

A method used by the operating system to choose which ready process will be run next on the CPU.

Ready Queue

A data structure that holds multiple processes that are waiting to be executed by the CPU.

Efficiency in Scheduling

The importance of minimizing the time spent on scheduling operations to maximize CPU usage for running processes.

Data Structures in Scheduling

Efficient representations of waiting processes and relevant information used for making scheduling decisions.

Process History

Information about how long a process has run in the past, which can influence scheduling decisions.

CPU Resources

Limited computational power available for executing processes, emphasizing the need for effective scheduling.