W01 | W02 | W03 | W04 | W05 | W06 | W07 | W08 | W09 | W10 || Key | Rank | LOG | GitHub
Multiple processor scheduling
This page briefly explains about Load Balancing. An important goal in a multiprocessor system is to balance the load between processors, so that one processor won’t be sitting idle while another is overloaded. Systems using a common ready queue are naturally self-balancing, and do not need any special handling. Most systems, however, maintain separate ready queues for each processor.
Operating System Scheduling algorithms
A tutorialspoint article on scheduling. Explains six popular process scheduling algorithms which we discuss in this chapter of Operating Systems. These algorithms are either non-preemptive or preemptive.
CPU-I/O Burst Cycle
Process execution begins with a CPU burst. That is followed by an I/O burst, which is followed by another CPU burst, then another I/O burst, and so on. Eventually, the inal CPU burst ends with a system request to terminate execution.
CPU Scheduling
A studytonight dot com article on CPU Scheduling. Explains the dispatcher, types of CPU Scheduling, and also critera for CPU Scheduling. Explains with readable font and is quite useful on quiz.
Short-term vs Medium-term vs Long-term scheduling
Another tutorialspoint dot com article. This time about Process scheduling which involves short-term scheduling, medium-term scheduling and long-term scheduling. The page explains it using a diagram and an explanation of said diagram.
What is the Round Robin scheduling algorithm?
This link will take you to the Geeksforgeeks website. This website is very interesting because the UI has a light theme, the explanations are also accompanied by pictures, and there is a table for comparison. In conclusion, the Round Robin algorithm is an algorithm which allows processes to be executed with a fixed time slot in a cyclic way.
Multilevel Queue Scheduling
This link will direct you to the website of our neighboring university, namely UGM (Gunadarma Margonda University). This website is pretty cool because it has pictures and diagrams which help to explain. In conclusion, Multilevel Queue Scheduling is an algorithm based on a process priority system. So, if each process can be grouped by priority, you will find a queue like the image on this website (see for yourself for easier understanding).
Shortest Job First?
A studytonight dot com article. This website is great because the explanation is comprehensiible and also accompanied by images. In conclusion, the shortest job first scheduling algorithm is an algorithm that runs processes based on the shortest burst time or duration.
FCFS scheduling algorithm
This link will take you to the guru99 website. The site explains in a very understandable language and is easy to digest because of the employment of diagrams and images. In conclusion, the first-come first-serve scheduling algorithm is an algorithm that automatically executes requests and processes queues based on the order in which they arrive.
What is an OVA?
This is a quick look on what an OVA file is. OVA File in short is like a backup or express installation for a Virtual Machine (VM). Let’s just say that it is pretty similar like how you install an app in android devices using apk file.