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 ?

Types of chat room, Types of chat room: Java Chat rooms: The most comm...

Types of chat room: Java Chat rooms: The most common and popular chat scripts are based on java which is object oriented language. Java is freely available and comes with virt

Register array, #queA register is a memory location surrounded by the CPU i...

#queA register is a memory location surrounded by the CPU itself, designed to be rapidly accessed for purposes of fast data retrieval. Processors normally hold a register array, wh

Describe gamma and its importance, Question 1 Describe HSV and CMYK color ...

Question 1 Describe HSV and CMYK color models Question 2 Describe gamma and its importance Question 3 What are the steps involved in image manipulation? Que

Data communication & net centric computing, Suppose there are exactly five ...

Suppose there are exactly five packet switches (Figure 4) between a sending host and a receiving host connected by a virtual circuit line (shown as dotted line in figure 4). The tr

Execute a command in operating system, Execute a command in operating syste...

Execute a command in operating system: In order to execute a command OS does the following steps:   It accepts a command from a user through mouse clicks or from t

Describe FCFS Scheduling algorithm ?, FCFS algorithm also known as: • Firs...

FCFS algorithm also known as: • First-In-First-Out (FIFO) • Run-Until-Done • Run-to-Completion • Possibly, First-Come-First-Served algorithm is the easiest scheduling algorithm i

Explain the architecture of wap, Question 1 Discuss the benefits and goals...

Question 1 Discuss the benefits and goals of e-commerce Question 2 List and explain the features of portal Question 3 Elaborate the TCP/IP model Question 4 Explain the archi

Briefly explain html and xml, Question 1 Briefly explain principles of eff...

Question 1 Briefly explain principles of effective navigation Question 2 Explain the terms URI and URL. Why should you use Relative URI? Question 3 What are the di

Operating system, Ask question describes deadlock avoidance#Minimum 100 wor...

Ask question describes deadlock avoidance#Minimum 100 words accepted#

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