Discover published sets by community

A CPU scheduling algorithm that processes requests in a cyclic order, applying a fixed time slice called a quantum.

A simple scheduling algorithm that processes requests in the order they arrive.

Processes are scheduled based on priority, with higher priority processes being executed first.

A dynamic scheduling algorithm where the process with the closest deadline is given the highest priority.

This scheduling method separates processes into different queues based on their priority or type, with each queue having its own scheduling algorithm.

Scheduling that prioritizes processes based on the proximity of their deadlines, ensuring that deadlines are met wherever possible.

A flexible scheduling algorithm where processes move between queues with different priorities, aging to prevent starvation.

A probabilistic scheduling algorithm where processes are assigned lottery tickets, and a random ticket selection determines which process runs next.

A scheduling method that selects the waiting process with the smallest execution time.

A method where each process is guaranteed a certain percentage of CPU time, and the scheduling ensures that this promise is kept over the long term.

A variation of scheduling where system resources are divided among groups of users or applications rather than individual processes.

Processes are given CPU proportions in a way that reflects their importance or priority, ensuring a predictable percentage of the CPU time.

A fixed priority policy that assigns priority to tasks based on the inverse of their request rate.

The preemptive version of SJF where the process with the shortest remaining burst time is executed next.