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
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
What are the different phases of compiler? What happens in lexical phase?
What is risc technology?
Explain page fault interrupt?
Explain compaction.
What are operating system services?
What is a named pipe?
Will chkdsk delete my files?
How do you tell if your os is corrupted?
Is 32gb of ram overkill?
What does 64bit mean?
What do you mean by threads in Operating System?
What are the 4 stages of computing?
What is the use of Synchronized keyword?
why is the context switch overhead of a user-level threading as compared to the overhead for processes? Explain.
Does chkdsk erase data?