Skip to main content

First-come, First-served Scheduling-computer world

 First-come, First-served Scheduling

In this scheduling algorithm simply the jobs according to their arrival time which job come first in the queue will get the CPU first. It means the process(job) that requests the CPU first is allocate the CPU first. The FCFS policy is simply and easily managed with a FIFO(First in First out) queue. When a process enter in the ready, its PCB is linked onto the tail of the queue. When the CPU is free, it allocated to the process at the head if the queue. The code for FCFS scheduling is very simple to understand. On the negative side, the average waiting time under the FCFS policy is long. The CPU has been allocated to a process, that process keeps CPU its processing is not complete. So the CPU in this scheme is scheduled to the process in the order of arrival at the ready queue it is the simplest CPU scheduling algorithm. 

1. Turn around time :

Turn around time is the time taken by a process between ready queue and finishing execution.

2. Wait time : 

Wait time is the time when a process wait before it's start execution.

3. Burst time: 

Burst time is that time which is taken by a process for its execution on the CPU.

Process P1, P2, P3 it's burst time is in the order 24, 3, 3

If the processes arrive in the order P1, P2, P3 and served in FCFS order. The waiting time for P1 is 0 millisecond, 24 millisecond for process P2, 27 millisecond for process P3. Thus the average waiting time is (0+24+27)/3=17 milliseconds.


Comments

Post a Comment

Popular posts from this blog

Deadlock in operating system-computer world

  Deadlock in operating system-computer world Deadlock :  In a multi-programming environment, many process may complete for a minute number of resources. A process make a request for a resource and if the resource is not available at that time, the process enter In a waiting state. A waiting state process is never again-able to change state because the resource it has requested is held by other waiting process. This situation is called deadlock. So we can say that a process is said to be deadlock when it is waiting for an event or resources which will never occurs.   so we can say that in this situation none of the process gets executed  since the resource it needs, is held by some other process which is also waits for some other resource to be released.  Let's assume that there are three process P1, P2, p3 and three different resources R1, R2 and R3. R1 is assigned to p1, R2 is assigned to P2 and R3 is assigned to P3.   After sometime P1 demands for R1 which is being used by  P2.
9 comments
Read more

CPU scheduling in operating system-computer world

  CPU scheduling in operating system CPU scheduling :  Whenever the CPU becomes idle, the operating system must select one of the processes. The selection process is carried by the short-term scheduler. The scheduler selects a process from the processes in memory that that are ready to execute and allocate the CPU to that process. The objective of time sharing is to skip the CPU among processes that user interact with each program while the program is in running position. As we discuss above the process scheduler selects an process for execution on the CPU. There will never more then one running process for a single processor system. If there are many processes, the process will have to wait until the CPU is free CPU Scheduling is basis of multi-programming operating system. In CPU scheduling many processes are kept in memory at a time. The CPU scheduler select a process from the many processes. The process scheduler scheduled different processes to be assigned to the CPU based on part
3 comments
Read more

Single partition allocation, Multiple-partition allocation and Fixed Equal-size partitions in operating system-computer world

  Single partition allocation, Multiple-partition allocation and Fixed Equal-size partitions in operating system Single partition allocation In this scheme operating system is residing in law memory and user process are executing in higher memory. Advantages It is simple  It is easy to understand and use Disadvantages User job is limited to the size of available memory. It leads to poor Utilization of processor and memory. Multiple-partition allocation  It is the simplest method for allocating  memory is divided memory into several fixed size partitions. Fixed Equal-size partitions It divides the main memory Into equal number of fixed sized partitions, operating system occupies some fixed portion and remaining portion of main memory is available for user processes. Advantages It supports multi programming. A process whose size is less then or equal to the partitions size can be loaded into any available partition. Disadvantages If a program is big to fit into a partition use overlay te
Post a Comment
Read more