hello, I want a chart which compare all scheduling algorithm
performance. I want to know even they act better for I/O
bound process or CPU bound process. please guide me how can
I recognize the difference of scheduling algorithm?
please send me the answer to : moradisomayeh@gmail.com
- 2 Answers
- 5209 Views
- I also Faced
- E-Mail Answers
Answer Posted / dave
We can compare the scheduling algorithm by using the
following methods.
1. throughput
2. turn aroung time
3. waiting time
4. response time
you can find the detail note from site
http://codex.cs.yale.edu/avi/os-book/os7/slide-dir/
| Is This Answer Correct ? | 7 Yes | 0 No |
Post New Answer View All Answers
How much ram do I have?
How do I run chkdsk on external drive?
What is multi tasking, multi programming and multi threading?
What do you mean by parallel processing?
Is gnome a shell?
How do I delete an operating system?
What is sdram?
Is 100 cpu usage bad?
Stable storage cannot be implemented. (A) Explain why it cannot be. (B) Explain how database system deal with database applications
What is belady's anomaly?
Which is the best operating system in the world?
What are the 5 basic filing systems?
Can you please explain the difference between trap and trapdoor?
How do I check my filesystem?
Why is round robin algorithm considered better than first come first served algorithm?
