Preemptive and Non-Preemptive Scheduling
The webiste explains about preemptive and non-preemptive scheduling including the key differences between both and the comparison chart/table. The explanations are simple and easy to understand.
Difference Between Dispatcher and Scheduler
As the title said, the website tells you about the differences between dipatcher and scheduler. Illustrations and tables are provided along the examples.
First Come First Serve (FCFS) Scheduling
The website explains about FCFS Scheduling with an example program. The topics discussed in the website are “What is FCFS method?”, how FCFS method works, characteristics od FCFS method, and advantages & disadvantages of FCFS method.
Shortest Job First (SJF) Scheduling
Shortest Job First is a Preemptive or Non-Preemptive algorithm. In the shortest job first algorithm, the job having shortest or less burst time will get the CPU first. It is the best approach to minimize the waiting time. The topics discussed are the characteristics, types, and advantages & disadvantages of SJF Scheduling. An example of SJF scheduling is also included.
Thread Scheduling
The website explains about Thread Scheduling with examples. The examples are in Java, and the explanations are clear. Topics discussed: thread race, selfish thread, time-slicing, and more.
Multi-Processors Scheduling
The topics discussed int the website are multiprocessing, processor affinity, load balancing, multicore processors, and virtualization & threading. In multiple-processor scheduling multiple CPU’s are available and hence Load Sharing becomes possible. However multiple processor scheduling is more complex as compared to single processor scheduling.
Earliest Deadline First (EDF) Scheduling
The website explains about EDF Scheduling with and example. Earliest Deadline First (EDF) is an optimal dynamic priority scheduling algorithm used in real-time systems. It can be used for both static and dynamic real-time scheduling.
Round Robin Scheduling
The website explains about Round Robin Scheduling with example. The example is provided with illustrations so you can understand better. The topics discussed in the website are the characteristics, advantages & disadvantages of RR scheduling, and worst case latency.
Rate Monotonic Scheduling
Rate monotonic scheduling is a priority algorithm that belongs to the static priority scheduling category of Real Time Operating Systems. It is preemptive in nature. The priority is decided according to the cycle time of the processes that are involved. The example in the website is provided with illustrations.
Linux Scheduler
The lecture slides from Columbia University explains about Linux scheduler. It explains about typical quanta, dynamic priority, linux is more efficient, sleeping and waking, and many more!