Skip to main content



 The vast majority of companies, specially small ones, turn to external data centers contracted through a hosting provider rather than having their own servers. However, in those businesses that have their own infrastructure and generally have an IT department, it is possible that if they have the appropriate facilities they can have their own server room. Having your own server infrastructure can have advantages and disadvantages. Hence, many companies that had this infrastructure have started outsourcing their data centers to save costs. Within a strategy of restructuring the company's servers, it is essential today to talk about virtualization. Server virtualization: lower operating costs Maintaining a server room has a number of associated costs that put a strain on the business. For example: •Energy costs derived from the general maintenance of the server room. •Acquisition and replacement of hardware on a regular basis. •Purchase and maintenance of business applic

FCFS Scheduling Full Form

 FCFS Scheduling Full Form

FCFS meaning for First Come First Serve. In the FCFS scheduling algorithm, the job that arrived first in the ready queue is allotted to the CPU after which the activity that got here 2d and so on. We can say that the prepared queue acts as a FIFO (First In First Out) queue as a result the arriving jobs/approaches are placed on the quit of the queue. 

Attention reader! Don’t stop studying now. Get hold of all the essential CS Theory standards for SDE interviews with the CS Theory Course at a pupil-friendly charge and turn out to be enterprise prepared.

FCFS is a non-preemptive scheduling set of rules as a process holds the CPU until it both terminates or performs I/O. Thus, if a longer job has been assigned to the CPU then many shorter jobs after it'll need to wait. This set of rules is used in maximum of the batch working systems. 


It follows the non-preemptive technique i.E. Once a procedure has manage over the CPU it will not preempt till it terminates.

The criteria for selection of approaches is arrival time. The dispatcher selects the primary job within the prepared queue and this process runs to finishing touch of its CPU burst.

The average ready time could be very excessive so now not premier and consequently gives bad overall performance. |


FCFS algorithm is easy, clean to put in force and apprehend.

Better for tactics with large burst time as there is no context switch concerned among strategies.

It is a truthful set of rules as priority is not worried, processes that arrive first get served first.


Convoy impact occurs i.E. All small techniques must look forward to one big method to get off the CPU.

It is non-preemptive, the process will not release the CPU till it finishes its undertaking and terminates.

It isn't always suitable for interactive systems because it can not assure quick reaction time.

Average ready time is excessive and the turnaround time is unpredictable which leads to bad performance.