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
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 is sdram?
Explain High Severity and Low Priority with example?
Explain about Operating System Security?
What are deadlock prevention techniques?
What is LiveLock?
What is ram parity?
Name the different types of memory?
Can I use x86 on 64bit?
How much ram do I need for gaming?
What is software life cycle?
What is Difference between thread and process?
28 Answers AirTies, Azingo, Bloomberg, Encora, Goldman Sachs, HCL, HP, MES, Microsoft, Samsung,
What do you mean by thread starvation?