scheduling processes

What Is First Come First Serve Scheduling Algorithm?

by

What Is First Come First Serve Scheduling Algorithm? First Come First Serve (FCFS) is an operating system scheduling algorithm that automatically executes queued requests and processes in order of their arrival. It is the easiest and simplest CPU scheduling algorithm. In this type of algorithm, processes which requests the CPU first get the CPU allocation

What Will Happen If The Chosen Time Quantum For RR Scheduling Is Too Long?

by

What Will Happen If The Chosen Time Quantum For RR Scheduling Is Too Long? In Round Robin Scheduling the time quantum is fixed and then processes are scheduled such that no process get CPU time more than one time quantum in one go. If time quantum is too large, the response time of the processes