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
Explain about Different types of real-time scheduling?
How long should a chkdsk take?
Can my processor run 64 bit?
What are short-term, long-term and medium-term scheduling?
Explain the layers of a windows xp system.
When does thrashing occur?
How do I copy and paste a file location?
What is the function of the control lines in ram?
When would you choose bottom-up methodology?
How many bit is my computer?
What do you mean by a process?
What is root partition?
What do you mean by memory leak?
What are the different functions of an operating system?
Briefly explain the concept of Virtual Memory.