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
- 5232 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
What is a semaphore? What are the different types of semaphores?
Is vmware a hypervisor?
What is a root program?
What is critical section problem?
How do I get to the root directory?
What are starvation and aging?
Can you list the coffman's conditions that lead to a deadlock?
Can I have two operating systems on one computer?
What are the popular strategies used for multiprocessor thread-scheduling?
On what level of security does windows nt meets?
What is a virtual memory?
Where the user store resides in OS?
What is starvation in operating system?
How do I find system information?
What is the difference between exclusive lock and shared lock?
