Banker’s Algorithm- Operating System – The banker’s algorithm is a resource allocation and deadlock avoidance algorithm that tests for safety
Operating Systems
12 Articles
12
An independent process is not affected by the execution of other processes while a co-operating process can be affected by other executing processes.
Deadlock Introduction – Operating System – A process in operating systems uses different resources and uses resources in following way.
Convoy Effect in Operating Systems – Operating System – Convoy Effect is phenomenon associated with the First Come First Serve (FCFS) algorithm
Program for Priority Scheduling | Set 1- Operating System – Priority scheduling is a non-preemptive algorithm and one of the most common scheduling
Round Robin scheduling- Operating System – Round Robin is a CPU scheduling algorithm where each process is assigned a fixed time slot in a cyclic way.
Shortest Job First (or SJF) scheduling | Set 1 (Non- preemptive) – Operating System – Shortest job first (SJF) or shortest job next
FCFS Scheduling | Set 2 – Operating System – We have already discussed FCFS Scheduling of processes with same arrival time. In this post, scenario
FCFS Scheduling | Set 1 – Operating System – Given n processes with their burst times, the task is to find average waiting time and average turn around
Process Scheduler – Operating System – It bring the new process to the ‘Ready State’. It controls Degree of Multi-programming