Scheduling algorithms indicate how much time is allocated to processes and threads. Their goal is to fulfill a number of criteria: All tasks must have the opportunity to use CPU resources. When it is time to use priority, a lower priority should not be deprived of more time high. The planner must adapt well to an increasing number of tasks. tasks, ideally being O(1). This is observed in the Linux kernel. Existing scheduling algorithms: There are three types. These are:1. Interactive planning algorithm2. Batch scheduling algorithm3. Real-time scheduling algorithm1. Interactive scheduling algorithms: There are four types: This uses only a single process queue. When the system triggers, the next process moves on and the preempted process is put back into the queue. Each process is assigned a time slot or “Quantum”. Quantum gives us the number of system timer ticks the process can run before being preempted. Each process is given a quantum, but the question is how to choose a quantum of time. Advantages: o It is a simple and strict “first come, first served” nature. Disadvantages: o Lack of priority system, due to which a low privilege has to wait for a higher privilege. Priority-based Round Robin: This is similar to Round Robin, but allows for a hierarchy of processes. Multiple process queues are used. As long as a higher priority process is in the queue, they run first and other lower priority processes wait. Advantages: o Its simplicity and reasonable priority support. Disadvantages: o Process lower priority...... middle of paper ... ...an achievable timetable. If the EDF algorithm fails to produce a feasible schedule, then no feasible schedule exists. When the goal of scheduling is to meet deadlines, there is no benefit to completing work earlier than necessary. Least margin time: It is also called minimum laxity first. Margin time is dt T is the remaining time to complete the work.  Example J1 is released at time 0, its deadline is 6, and its execution time is 3 At time 0, the slack time is 3 As long as it executes, its margin remains at 3 Now suppose that it is preempted at time 2 by J3 who executes from time 2 to 4 During this interval, the slack of J1 decreases from 3 to 1 At time 4, the execution time remaining of J1 is 1 The LST algorithm assigns priorities to jobs based on their sets The smaller the set, the higher the priority The LST algorithm is optimal.