Explain long term scheduling, Operating System

Assignment Help:

Long term scheduling

Scheduling explicitly performed when a new process is created and it determines which programs are admitted to the system for processing. Therefore it controls the degree of multiprogramming. Formerly admitted it becomes a process and is added to the queue for the short term scheduler. It take on two decisions in the process creation that are First- the scheduler must decide that the operating system can take on one or more additional processes and Second- the scheduler must decide which job or jobs to accept and turn into processes.

The decision with regard to when to create a new process is usually driven by the desired degree of multiprogramming. Much the processes created smaller is the time that every process can be executed for.  The decision in respect of which job to admit next is able to be on a simple first come first serving basis or it can be a tool to manage system's performance. The criteria may comprise expected execution time, priority and IO requirements

 


Related Discussions:- Explain long term scheduling

Dual Mode Operation, I am not getting what you have tried to describe here....

I am not getting what you have tried to describe here. Can you elaborate more about this, i will be thankful to you. Vinay

Describe paging technique used in unix systems, Describe paging technique u...

Describe paging technique used in UNIX systems. When a process begin in UNIX, not every its memory pages are read in from the disk at once. In its place, the kernel loads into

Illustrate the handshaking protocol, Q. The instance of handshaking used 2...

Q. The instance of handshaking used 2 bits: a busy bit as well as a command-ready bit. Is it probable to implement this handshaking with only 1 bit? If it is illustrate the protoc

What inference does recovery in distributed systems, Q. Consider a distrib...

Q. Consider a distributed system with two sites A and B. Consider whether site A can distinguish among the following: a. B goes down. b. The link between A and B goes down.

Write a note about directory structure with examples., Write a note about ...

Write a note about Directory structure with examples. The FreeBSD directory hierarchy is basic to obtaining an overall understanding of the system. The most significan

Explain types of file allocation- linked list allocation, Linked list alloc...

Linked list allocation: At this time the blocks are stored using linked lists. The block size require not be the same. Thus internal fragmentation is avoided. Consider

Evicting pages from physical memory, When do we write a page from physical ...

When do we write a page from physical memory back to the disk? In general, caches have two broad types of writing policies. One approach is a write-through cache. In this case,

Define buffering, Define buffering. A buffer is a memory area that keep...

Define buffering. A buffer is a memory area that keeps data whereas they are transferred among two devices or among a device and an application. Buffering is done for three rea

Define implementation of segmentation with an example, IMPLEMENTATION OF SE...

IMPLEMENTATION OF SEGMENTATION WITH AN EXAMPLE Segmentation is a memory-management scheme that represents the user view of memory. A logical address space is the collection of

Disk scheduling algorithms-first come, FCFS (First Come, First Served) Per...

FCFS (First Come, First Served) Perform operations in order requested No reordering of work queue No starvation every demand is serviced Poor performance

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