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 ?

DR Racket program, Hi, I''m looking for someone to help me with Computer Sc...

Hi, I''m looking for someone to help me with Computer Science ASAP. How soon are you available? Thanks! Specifically using the Racket program dealing with creating a list that will

Networking operating systems, Networking Operating Systems,  Networking OS ...

Networking Operating Systems,  Networking OS provides file sharing, Networking OS provides communication scheme, NT Server Security added Multi user capability added RAI

Write down dijkstra''s algorithm, QUESTION (a) Write down the Update ...

QUESTION (a) Write down the Update Step in the Dijkstra's algorithm explaining its complexity. (b) Propose a Generic Algorithm for Depth-First Search Algorithm, assuming

IPC in linux, to do a assignment regarding IPC in linux

to do a assignment regarding IPC in linux

Flowchart, 1. The volume of a pyramid is taken from the formula: V = 1/3 x ...

1. The volume of a pyramid is taken from the formula: V = 1/3 x AREA OF BASE x ALTITUDE Given the dimensions of a pyramid, calculate the cost of materials for making that pyrami

Enterprise collaboration system, what is the goals of enterprise collaborat...

what is the goals of enterprise collaboration system?

Data structuures, write a fuctions for MIDSQUARING hashing technique

write a fuctions for MIDSQUARING hashing technique

Define interlibrary lending, QUESTION (i) Define each of the following ...

QUESTION (i) Define each of the following terms: a) Interlibrary lending b) Manuscript c) Papyrus d) Community profile e) Mauritiana (ii) Explain with example

Discuss about xpointer, Question 1 How PHP works? Explain the structure of...

Question 1 How PHP works? Explain the structure of PHP Question 2 Write a note on links and webs Question 3 Explain why do you need Document Type Definition (DTD)?

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