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 ?

Block diagram of digital computer, Block diagram of digital computer: ...

Block diagram of digital computer: The general pattern of computer architecture has remained unchanged over the last four decades or so. It has a single processor, which accep

Challenges in building information system, discuss the three major challeng...

discuss the three major challenges in building information system in an organization

Loading instructions, They are particular register instructions. They are u...

They are particular register instructions. They are used to load bytes or sequences of bytes onto a register. LODS (LODSB) (LODSW) LAHF LDS LEA LES LODS (LODSB) (LODSW) INSTRUCTION

Stack, How to write an algorithm to reverse the order of elements on a stac...

How to write an algorithm to reverse the order of elements on a stack s using two additional stacks

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

Write a half-page summary explaining IP spoofing.

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

How to Open a FCB files?, Opening files 0FH function is used to open an F...

Opening files 0FH function is used to open an FCB file the 21H interruption. The element, the name and extension of the file must be initialized previous to opening it. The DX regi

What is Assembly Language?, Assembly language is fundamentally the local la...

Assembly language is fundamentally the local language of your computer. In principle the processor of your machine understands machine code (consisting of ones and zeroes). But wit

Magnetic core memory, MAGNETIC CORE MEMORY: This type of memory is used...

MAGNETIC CORE MEMORY: This type of memory is used extensively in airborne digital systems, although integrated circuits are being developed with most modern aircraft systems.

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