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
- 5637 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
Which is better internet explorer or edge?
Can I upgrade from 32bit to 64bit?
What are device drivers?
What is a hard real time OS?
How much ram do I have?
Difference between a thread and process?
What is dlm?
Can I upgrade my cpu from 32 to 64 bit?
Explain the basic concepts and hierarchy of memory?
How to recovery from deadlock?
Describe the Operating System concept of Segmentation
What is ecc in reference to ram?
What is fragmentation? Different types of fragmentation?
What are placement and replacement algorithms in the context of memory management?
What is the Difference between Loading and Linking ?
