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 ?

Computer architecture, Subject Name CIT2193 COMPUTER ARCHITECTURE Topic AS...

Subject Name CIT2193 COMPUTER ARCHITECTURE Topic ASSIGNMENT Due Date 16 March 2012 Name : ……….…………………….……………….. Lecturer : ................................. Intake : ………………….

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

What is a font, Question 1 What is a desktop? Explain the Windows XP deskt...

Question 1 What is a desktop? Explain the Windows XP desktop? Question 2 How does a flash drive work? Question 3 Write the procedure for creating Macro Question 4 E

Abstraction is a popular way to organize concurrent programs, 1. The proces...

1. The process abstraction is a popular way to organize concurrent programs, but it is not the only choice. An alternative to the process abstraction is to design a single-threaded

ExtremeWhether.html, How to crete a web page name esp.html that allows user...

How to crete a web page name esp.html that allows users to conduct an ESP test

Backup software, Backup software: A number of Backup software are avai...

Backup software: A number of Backup software are available that assist you in taking backup of your important data on the computer. Selecting between various back-up software

List two i/o virtualization methods, Question 1 List two I/O virtualizatio...

Question 1 List two I/O virtualization methods. Based on different features compare these two methods Question 2 Discuss three areas considered by organizations to secure the

Examples of online databases, Examples of Online Databases: The adopti...

Examples of Online Databases: The adoption of modern technology has resulted in the proliferation of machine readable databases. The National Library of Medicine (USA) designe

Time and space tradeoffs in search, Time and Space Tradeoffs in search-arti...

Time and Space Tradeoffs in search-artificial intelligence: In practice, you need to stop your agent at some stage if it has not searched a solution by then. However, if we can

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