CPU Scheduling
A good article explaining about maximizing CPU through CPU Scheduling. There are a number of objectives in Process Scheduling Algorithm. There are also different types of the said algorithm, with different ups and downs. The article also has a small quiz at the end with answers explained.
CPU and I/O Burst Cycles
A nice video explaining about CPU burst and I/O burst. A process execution consists of a cycle of CPU execution and I/O wait. It alternates between the two. And at the end, there will be one last CPU execution, requesting to terminate the current process. The video also shows an example on this type of process.
CPU Scheduling Criteria
As explained before in the first article, different CPU Scheduling Algorithms have different properties and the choice of particular algorithm depends on various factors. These criterias helps decide which algorithm to choose.
Preemptive and Non-Preemptive Scheduling
A nice article explaining the differences between Preemptive and Non-Preemptive Scheduling in Operating Systems. Preemptive are used when a process wants to change from waiting to ready state. Non-preemptive are used when a process is waiting from running to a waiting state.
Difference between Asymmetric and Symmetric Multiprocessing
Multiprocessing is the use of two or more central processing units within a single computer system. Differences are Asymmetric doesn’t treat proccessors equally, tasks of the operating system are done by master processor, and process are master-slave. Symmetric treats processors equally, tasks of the operating system are done by individual processor, and the process are taken from the ready queue.
Multiprocessor Scheduling in Operating System
An explanation about scheduling done in a multiprocessor system. A multiprocessor system consists of several processors which share memory. In the multiprocessor, there is more than one processor in the system. Since there are more than one processor or CPU, various process can run simultaneously.
Priority Scheduling Algorithm in Operating System
A well-written article explaning the Priority Scheduling Algorithm. It uses priority on scheduling all the tasks. Preemptive and Non-Preemptives, both are types of Priority Scheduling. The article also has some examples on priority scheduling to help understand more.
Scheduling Priorities - Windows
This article explains how Windows OS uses scheduling priorities on their system. There are Priority Class, Priority Level, and Base Priority.
When you set a 100% CPU program to real-time priority, you get what you asked for
What happens when you set a 100% CPU program to real time priority? The program will use all the CPU’s resources, that means it is the highest priority, not even your mouse or keyboard input will override it, and it’s almost impossible to read your input in attempt to terminate it.
Completely fair Scheduler (CFS) and Brain Fuck Scheduler (BFS)
An interesting name on Scheduling. These process scheduler are used in Linux. Each scheduler has it’s characteristics, with time complexity analysis.