define Shortest-Job-First (SJF) Scheduling ?, Basic Computer Science

Assignment Help:

• It is also known as Shortest-Process-Next (SPN).
• Shortest-Job-First (SJF) is a non-preemptive order in which waiting job (or process) with the smallest predictable run-time-to-completion is run next. In other language, when CPU is available, it is allotted to the process that has smallest next CPU burst.
• The SJF scheduling is mainly suitable for batch jobs for which the run times are known in advance. Since the SJF scheduling algorithm gives the minimum average time for a given set of processes, it is almost certainly optimal.
• The SJF algorithm helps short jobs (or processors) at the cost of longer ones.
• The understandable problem with SJF scheme is that it requires precise acquaintance of how long a job or process will run, and this information is not generally available.
• In the production environment where the same jobs run frequently, it may be possible to provide reasonable estimate of run time, based on the past presentation of the process. But in the development environment users not often know how their program will execute.
• The best SJF algorithm can do is to rely on user approximation of run times.
• Like FCFS, SJF is non preemptive therefore, it is not helpful in timesharing environment in which reasonable answer time must be sure.

Related Discussions:- define Shortest-Job-First (SJF) Scheduling ?

Block diagram of digital computer, Block diagram of digital computer: ...

Block diagram of digital computer: The general pattern of computer architecture has remained unchanged over the last four decades or so. It has a single processor, which accep

CIS247 week6 Lab., Modify the class declaration of the Employee class to sp...

Modify the class declaration of the Employee class to specify that the Employee class is an abstract class Declare an abstract method called CalculateNetPay that returns a double v

Cppm, sum of first 100 integers

sum of first 100 integers

One dimensional array, One dimensional array:  A one-dimensional arra...

One dimensional array:  A one-dimensional array  is a structured collection of elements  that can be accessed individually by specifying the position of a component with  ind

What are the goals of wap architecture, Question 1 Explain the naming conv...

Question 1 Explain the naming conventions of functions in WML scripts and also explain characteristics of functions in WML Question 2 What is WML input field? Explain WML

Data base software, Data Base Software: Another major type of applicat...

Data Base Software: Another major type of application comes under the heading database software; which allows for the collection of, searching for and manipulation of informat

Operating system problems, 1. In discussing software algorithms for mutual ...

1. In discussing software algorithms for mutual exclusion, we noted that optimizing compilers and out-of-order execution by processors could invalidate most of these algorithms bec

Explain the concept of linking and relocation, Question 1 Write an assembl...

Question 1 Write an assembly language program to find the highest among two numbers Question2 Draw and explain the internal architecture of 8085 briefly Question3 Explai

Netlogo, Do you have expert can deal with netlogo

Do you have expert can deal with netlogo

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd