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 ?

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

#, #queswhat computers can do tion..

#queswhat computers can do tion..

What are the tasks of ALU and their subcomponents, ALU’s tasks and their s...

ALU’s tasks and their suitable subcomponents: Addition and subtraction these two tasks are carried out by constructs of logic gates, such as half adders and full adders. While they

Analogue computers, ANALOGUE COMPUTERS A computer is basically a proble...

ANALOGUE COMPUTERS A computer is basically a problem-solving device. In aircraft radio systems the problem to be solved is concerned with navigation, in that given certain inf

Hill climbing - artificial intelligence , Hill Climbing - artificial intell...

Hill Climbing - artificial intelligence: As we've seen, in some particular problems, searching the search path from primly to goal state is the point of the exercise. In anothe

Describe the protocol used by the mmu, Question 1: a) A distinction is...

Question 1: a) A distinction is often made between computer architecture and computer organisation. Describe, using examples, the meaning of computer architecture. b) Name

Internet, Explain how the internet works

Explain how the internet works

Probability, Suppose that of 100 computers checked for viruses 30 where inf...

Suppose that of 100 computers checked for viruses 30 where infected and 70 where not. If we select 10 computers at random what is the probability that at most 4 of them are infecte

Java programming, what are the phases of oo progarmming or java?

what are the phases of oo progarmming or java?

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