Skip to main content

Shortest job next scheduling in operating system-computer world

 Shortest job next scheduling 

Shortest job Next Scheduling (SJN) is also known as shortest job first(SJF). In SJF Scheduling the processes which have the smallest execution time is chosen for the next execution. When the CPU is available, it is assigned to the process that has the smallest next CPU burst. If the next CPU burst of two processes is same then FCFS Scheduling is used to break the tie. SJF Scheduling gives the minimum average waiting time fir a given set of processes. Moving a short process before a long process the waiting time of short process more then it increase the waiting time of long process so the average waiting time decrease. 

Process.                                  Burst time

A1                                                 6

A2                                                 8

A3                                                 7

A4                                                 3

The waiting time for process A1 = 3 millisecond 

The waiting time for process A2 = 16 millisecond 

The waiting time for process A3= 9 millisecond 

The waiting time for process A4 = 0 millisecond 

Thus the average waiting time = (3+16+9+0)/4 =7 millisecond 


Comments

  1. Zulkarnain aliDecember 26, 2020 at 11:07 AM

    amazing bro lekin abka theme thoda kharab ha agar apko woozone theme ya koi doosra theme chahiya toh mujha batana christmas offer chal raha ha wo bhi 80 percent off ka sath sirf 299 rs ma 100% original with gsl license pora saal bhar ka sabsa bada offer
    email karo ya insta pe dm my id zulkrnain_ali_zab

    ReplyDelete

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