Round Robin Scheduling:How to find the Average Queue Length and Maximum Queue Length of the Ready Queue?

Question

1.00/5 (1 vote)

See more:

For example,take process p1,p2,p3,p4,p5 with respective burst time as 6,5,2,3,7 seconds and cpu time quantum 2 seconds.Can any one tell me how to calculate the average ready queue length and the maximum ready queue length[For Round Robin Scheduling]? Here Ready Queue=>the queue from where we have to en-queue and de-queue during the processes execution. Actually, I have not got the formula or how to find these parameters anywhere till now.So any help will be highly appreciated. Thanks, Avishek

Posted 2-Nov-13 9:56am

avishekrc

Add a Solution

Comments

Sergey Alexandrovich Kryukov 3-Nov-13 15:08pm

Not clear. What queue do you mean? Let's say, you have 1 CPU of 1 core and N application threads. Apparently, most of the time, N-1 threads are waiting for being scheduled, and 1 thread is running, and during some short period of time needed for operation of scheduler itself and thread switching, all N threads are waiting. If you can ignore that short period of time, N-C threads are waiting if you have C cores...
—SA

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)