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 ?

statistics, write a 2 page essay operational gaming and monte carlo simula...

write a 2 page essay operational gaming and monte carlo simulation

Multi-valued attribute dbms, Multi-valued Attribute DBMS Each multi valued ...

Multi-valued Attribute DBMS Each multi valued attribute maps into a separate table. Include also an attribute for the primary key of the entity and relationship type which the attr

Telecommunication networks architecture, Telecommunication Networks Archite...

Telecommunication Networks Architecture is the manner in which the components of thenetwork are organized and integrated to provide telecommunication services to users ofthe netwo

Explain the concept of a transition graph, Question 1 Define the concept o...

Question 1 Define the concept of equivalence relation. Give atleast two examples of equivalence relation Question 2 Prove that a graph G is connected if and only if it has a

Prelude to programming concepts and design 5th edition, Input a list of pos...

Input a list of positive numbers, terminated by 0, into an array numbers []. Then display the array and the largest and smallest number in it.

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

What is Shortest-Remaining-Time (SRT) Scheduling?, • The SRT is the preemp...

• The SRT is the preemptive complement of SJF and helpful in time-sharing environment. • In SRT scheduling, the process with the least estimated run-time to completion is run next,

Computerised systems, Computerised Systems : You would have realized by no...

Computerised Systems : You would have realized by now that computing systems are most useful for manipulating information. Any organisation and management of information basically

Q1, Write a half-page summary explaining IP spoofing.

Write a half-page summary explaining IP spoofing.

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