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 ?

Graphical user interface and arrays, In this program, you are going to writ...

In this program, you are going to write a program for playing the game of Hangman. In this game, the computer will pick a word and display a sequence of blanks to be filled in; one

Calculate simple interest -algorithm, Algorithm : 1. Read the values of pri...

Algorithm : 1. Read the values of principal amount, time and rate of simple interest into the locations labelled as P, T, R. 2. Set the count T to 1 implying the end of a year. 3.

Cryptography, For which X,Y in {o, O, Theta, Omega, omega}, do the relation...

For which X,Y in {o, O, Theta, Omega, omega}, do the relationships t(n)+t''(n) = X(min(t(n),t''(n))) and t(n)+t''(n) = Y(max(t(n),t''(n))) hold for all t,t'' such that t(n),t''(n)

Dataflow modeling for dsp design, Dataflow Modeling for DSP Design The ...

Dataflow Modeling for DSP Design The necessary components in the research of application-specific computer architectures are: 1) a clearly identified set of problems that can b

Explain Modern architecture of microprocessor, There are many other techniq...

There are many other techniques in which companies who manufacture microprocessors have attempted to get better the performance of their CPUs. Cache memory this is a small quantit

Java - Stack and Queue, Consider a class called Configuration. This class “...

Consider a class called Configuration. This class “encapsulates” the configuration management for any software system. For example, once created, the user can simply ask the config

Computer definition ., what is the short and complete definition of compute...

what is the short and complete definition of computer

Research and development , Research and Development  All intellectual ...

Research and Development  All intellectual activities consciously pursued and systematically completed generate useful information. Research (also Research and Development) is

Explain uses of system call and its major types, In computing, a system cal...

In computing, a system call is how a program asks for a service from an operating system''s kernel. This may contain hardware related services (for example accessing the hard disk)

Soft computing, Defination of Propositionl logic Predicate logic genertic a...

Defination of Propositionl logic Predicate logic genertic algorithm Hybrid system Optimization Fuzzy system rules Fuzzy system application

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