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 ?

Database reports, The first report, Report #1, is to be an ordered list of ...

The first report, Report #1, is to be an ordered list of the contents of the database, sorted in ascending order by a major field. Report #1 is to include all of the fields and rec

Omputer applications 2, true or false-- most designs of a desktop publishin...

true or false-- most designs of a desktop publishing document needs to follow clear, specific rules pertaining to design

What are the characteristics of a good documentation?, Question 1 What are...

Question 1 What are the differences between closed and open systems? Question 2 What are the characteristics of a good documentation? Question 3 What are the steps invol

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

Frequency and bandwidth, Frequency and Bandwidth: Let us try to unders...

Frequency and Bandwidth: Let us try to understand a little about how information is transmitted. The information may be in the form of sound (human voice, music) or it may be

C language, parent and child process using c language

parent and child process using c language

What is nanp? explain, Question 1 What is NANP? Explain Question 2 ...

Question 1 What is NANP? Explain Question 2 What is E&M signaling? Discuss in brief Question 3 What are the common custom calling features? Question 4 Expl

Operating system, Does Process Manager in Operating System know the depende...

Does Process Manager in Operating System know the dependency order that Process A depends on Process B?

What is the benefit of Threads?, Following are some causes why we use threa...

Following are some causes why we use threads in designing operating systems. A process with several threads makes a great server for instance printer server. For the reason that t

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