Data Structure of a Ready Queue
First hi ! to all the readers, before we can emphasize the topic, i would like to tell us why a data structure is required for an OS.
The OS as we know is a System program and work as a Resource manager. So they are really unaware what they have to follow, they have to capitalize the whole resources in an efficient way without affecting any section of own. The System programs are the basic one who works directly on the hardware, and care of all system components for their own operation. That's why they are never for a naive user.
Ok ! so now we should not have to go away from title. Actually there are so many data structures used before the ready queue but we will see in next post. The data structure followed by ready queue is Double Ended Queue also called as ( Dequeue ) . Here is the short definition of ready queue.
Dequeue (double ended queue):A Dequeue is a linear list for which insertions and deletions(accesses as well) occur at the ends.
As we know in ready queue two ends Rear and Front as Move in process and Moved out process named. So it may be at any instance one end may submit the job but same instance other end swap or submit the process for further localization and manipulation. Look in figure given below.
So I think this post must add something in your knowledge base , please give your comments by which, I can improve it and don't forget to post your questions thank's...
