FCFS Tabular Method
The usual method of computing average time, average wait time, turnaround time and average turnaround time for processes is to make a Gantt Chart and… Read More »FCFS Tabular Method
Home ยป
CPU Scheduling
Shortest Remaining Time First (SRTF)
The shortest job first (SJF) algorithm is preemptive or non-preemptive. You have learned about the non-preemptive SJF in the previous article. In this article, you… Read More »Shortest Remaining Time First (SRTF)
Multilevel Queue
A multilevel queue is suitable when the processes are classified in groups. The multilevel queue scheduling algorithm partition the queue into several separate queues. Each… Read More »Multilevel Queue
Priority Scheduling
A scheduling algorithms like round-robin treat all processes as same. But if we consider other information about a process, some process is more important than… Read More »Priority Scheduling
Shortest-Job-First ( SJF )
The shortest job first algorithm associates the length of the next CPU burst with each process. The CPU time is assigned to a process with… Read More »Shortest-Job-First ( SJF )
Round Robin
The round-robin scheduling algorithm is suitable for time-sharing computers which are similar to FCFS. However, preemption is added to this algorithm to switch between processes.… Read More »Round Robin
First Come, First Served (FCFS)
The first come first served (FCFS) is the simplest CPU-scheduling algorithm. The process which requests CPU first will be allocated CPU first and so on.… Read More »First Come, First Served (FCFS)
Types of Schedulers
The multi-programming technique wants high CPU utilization by executing some process all the time. The time-sharing computer keeps switching among processes so that all users… Read More »Types of Schedulers
Process Scheduling Criteria
The single processor system, one process runs, and other processes wait until CPU is free. In a multiprocessor system, some process always runs and thus… Read More »Process Scheduling Criteria