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
- 5210 Views
- I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / 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 |
Answer / anshul bhatnagar
One can not compare the performence for a sheduling
algorithm. as they depends on the use or the requirements
of the system.
for example for one case the FCFC algo can be better and
for the other case the SJF can be benificial.
| Is This Answer Correct ? | 8 Yes | 2 No |
What join() method does?
What is starvation and aging?
What are the different ram standards/versions?
Explain the refresh operation in a dynamic ram?
Does grep ignore case?
How do I know if I have a 64 bit processor?
Different types of real-time scheduling?
What is the dispatcher?
What are the four layers that Windows NT have in order to achieve independence?
Which is the best page replacement algorithm and Why? How
How will you check if your R3 system is 32bit or 64bit?
What is the shortest definition of os?
Windows 
