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 ?

Finite Automata, (S**)*=S*** is this set bigger than S*??

(S**)*=S*** is this set bigger than S*??

Computer Networking Scenario help, The project designs a school computer la...

The project designs a school computer lab with the necessary hardware and software components along with the IP address for different components. The computer lab consists of one I

Definition of procedure, A procedure is a compilation of instructions to wh...

A procedure is a compilation of instructions to which we can express the flow of our program, and once the execution of these instructions is over power is given back to the next l

Describe Priority Scheduling algorithm of operating system?, Priority Sched...

Priority Scheduling • The fundamental idea is straightforward: each process is assigned a priority, and priority is permitted to run. Equal-Priority processes are scheduled in FCF

C++, whats the out put of int main(){ int n=310; funcone(n); functwo(&n); ...

whats the out put of int main(){ int n=310; funcone(n); functwo(&n); cout return 0; } void funcone(intn) n=240; } void func two(intn*) { n=120; }

Visual basics, Assume that s is a string variable  that is supposed to con...

Assume that s is a string variable  that is supposed to contain a value to be converted to integer. Write a fragment of code that converts the value to integer variable  and displ

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