What are scheduling queues?, Operating System

Assignment Help:

What are scheduling queues?

Since the processes enter the system they are put into job queue. This queue contains all processes in the system. The processes that are exist in main memory and are ready and waiting to execute are kept on a list called as the ready queue. The queue is in general stored in as a linked list. A ready queue header consist pointer to the first and final PCBs in the list. We extend every PCB to include a pointer that points to the next PCB in the ready queue.

When the process is assigned the CPU, it implements for a while and executes for a while and eventually quits is interrupted or waits for the occurrence of a particular event such as the completion of a request for example the completion of an I/O request. In the case of an I/O request such a request perhaps dedicated tape drive and so on. since the system has several processes, the disk perhaps busy with the I/O request of some other processes.  The process afterward has to wait for the disk. The listing of processes waiting for a particular I/O device queue is called as a device queue.

A new process is originally put in the ready queue. It waits in the ready in anticipation of it is selected fro execution. Formerly the process is assigned to the CPU and is executing one of several events could take place:

  •  
    1. The process could issues I/O request, after that be placed in an i/o queue.
    2. The process could create a new sub process in addition to wait for its termination.
    3. The process could be detached forcibly from the CPU as a result of an interrupt and be put back in the ready queue.

In the first two cases the process finally switches from the waiting state to the ready state and is then put back in the ready queue. A process keep going this cycle until it terminates this cycle until it terminates at which time is removed from all queues and has its PCB and resources deallocated.


Related Discussions:- What are scheduling queues?

What are the various layers of a file system, What are the various layers o...

What are the various layers of a file system? The file system is composed of many dissimilar levels. Each level in the design uses the feature of the lower levels to make new f

Explain about threading issues, Explain about threading issues? The for...

Explain about threading issues? The fork and exec system calls In a multithreaded program of few UNIX systems have chosen to have two versions of fork, one that duplicates e

Explain general graph directory, General graph directory The serious pr...

General graph directory The serious problem with using an acyclic-graph structure is ensuring that there are no cycles. When we insert links to an existing tree-structured dire

Virtual addresses, Virtual addresses are made up of two parts: the ?rst par...

Virtual addresses are made up of two parts: the ?rst part is the page number, and the second part is an offset inside that page. Suppose our pages are 4kb (4096 = 212 bytes) long,

Operating system abstractions, When we download a movie from the Internet, ...

When we download a movie from the Internet, we don't care about, say, packet sizes. However, even ifwe are not aware of howlow-level details of networks are implemented, our data i

Define ageing, Define Ageing Ageing is a method of enhancing the priori...

Define Ageing Ageing is a method of enhancing the priority of process waiting in Queue for CPU allocation

Explain the various methods for handling deadlocks, Explain the various met...

Explain the various methods for handling deadlocks.      A set of processes is deadlocked if every process in the set is waiting for an event that only a process in the

Explain the fork function, Explain the Fork Function Fork function caus...

Explain the Fork Function Fork function causes a new process to be created. The calling progress is duplicated as an exact copy (called the child process) that differs only in

Identifying parallelism, Identifying parallelism A formal way to identi...

Identifying parallelism A formal way to identify parallelism in an activity is to draw a task dependence graph in a directed graph in which each vertex represents a task to

What is turnaround time, What is turnaround time? Turnaround time is th...

What is turnaround time? Turnaround time is the interval from the time of submission to the time of completion of a process. It is the sum of the periods exhausted waiting to g

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