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 ?

Data buses, Data buses: The availability of reliable digital semi-condu...

Data buses: The availability of reliable digital semi-conductor technology has enabled the inter-communication task between different equipment to be significantly improved. P

OPERATING SYSTEM, WHAT IS MULTIPLE CONTIGUOUS VARIABLE PARTITIONING

WHAT IS MULTIPLE CONTIGUOUS VARIABLE PARTITIONING

Types of browsers, Types of Browsers: Line Mode Browsers : The initia...

Types of Browsers: Line Mode Browsers : The initial browsers were line mode text browsers. These browsers were simple and used to display text line by line. They used to prov

If staement, if statement with explanation

if statement with explanation

Subroutine , Subroutine :   A subroutine  is a type of subprogram, a pi...

Subroutine :   A subroutine  is a type of subprogram, a piece of code within a larger program that performs a specific task and is relatively independent of the remaining code.

With an example, Question 1 With an example, illustrate the concept of ext...

Question 1 With an example, illustrate the concept of extern variable Question 2 What is the difference between pointer variable and simple variable? Question 3 Give the

What are the Proposals for Achieving Mutual Exclusion?, Proposal a) Disabli...

Proposal a) Disabling Interrupts (Hardware Solution) • Every process disables all interrupts just after entering in its critical section and re-enables all interrupts just previous

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