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 ?

Algorithm - programming language, Algorithm : Once a problem has been defi...

Algorithm : Once a problem has been defined precisely, a procedure or process must be designed to produce the required output from the given input. Since a computer is a machine t

Optical fibres, Optical Fibres: Coaxial cables have limitations such a...

Optical Fibres: Coaxial cables have limitations such as broadband transmission medium which can be overcome by the use of optical fibres. Optical fibres carry light waves (rep

Indexing a page on internet, Indexing a page on internet: Once, the sp...

Indexing a page on internet: Once, the spiders have completed the task of finding information about Web pages, the search engine must store the information in such way that yo

Describe counting instructions, They are used to reduce or enlarge the cont...

They are used to reduce or enlarge the content of the counters. DEC INC DEC INSTRUCTION Idea: To diminish the operator. Syntax: DEC destiny This action subtracts 1 from the destiny

Computer, hitory and genration of computer

hitory and genration of computer

Hangman, Aim This assignment is intended to assess your skills in understan...

Aim This assignment is intended to assess your skills in understanding and interpreting a moderately complex problem, designing a solution to the problem and implementing the desig

Program planning (preparation of a flow chart), Program Planning (Preparati...

Program Planning (Preparation of a Flow Chart) A flow chart is a graphic method for indicating a proposed or actual solution to the problem. A flow chart shows the steps a comp

Poset , 1. (40 points) Add a course drop method to the system that you impl...

1. (40 points) Add a course drop method to the system that you implemented in Problem Set 1. Modularize your new implementation properly. For any new methods that you introduce: 1.

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