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 ?

Browser cookies, Browser Cookies: A cookie is a small message sent by ...

Browser Cookies: A cookie is a small message sent by the Web server to a your web client. This message is stored by the browser as a text file. The basic purpose of cookie is

Define segments in assembly process?, The architecture of the x86 processor...

The architecture of the x86 processors forces with the use of memory segments to direct the information, the size of these segments is of 64kb. The cause of being of these segments

Flowcharting, Flowcharting: Flowcharting: A Flowchart is a graphical r...

Flowcharting: Flowcharting: A Flowchart is a graphical representation of an algorithm. It can be compared to the blueprint of a building. Just as a building contractor refers

Methods of working with files, There are two methods to work with files, th...

There are two methods to work with files, the first one is through file control blocks or "FCB" and the second one is through communication channels, also identified as "handles".

Sql server management studio assignment, Department (DeptNo, DeptName, Offi...

Department (DeptNo, DeptName, Office, Phone) Employee (EmpNo, FirstName, LastName, JobTitle, HireDate, Salary, MgrNo, Deptno) Customer (CustNo, CompanyName, Street, City, State, Zi

Define Multilevel Queue Scheduling?, • A multilevel queue scheduling algori...

• A multilevel queue scheduling algorithm divides the ready queue in several separate queues, for example • In a multilevel queue scheduling processes are lastingly assigned to one

Expalin Processes Vs Threads?, In many respect threads operate in the simil...

In many respect threads operate in the similar way as that of processes. A number of the similarity and differences are: Similarities • Similar to processes threads share CPU and o

Pipelining concept, The easiest way to approach pipelining is to regard as...

The easiest way to approach pipelining is to regard as the three stage fetch, decode and execute instruction execution cycle outlined earlier. There are times during each of these

Hacking, how can i hack a server

how can i hack a server

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