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
- 5224 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
Explain about Different types of real-time scheduling?
What is an OS? Explain it to a layman.
What are the different ways in which data can be represented?
How do I search for excel files on my computer?
How does the system detect thrashing?
How can I boot from usb?
What is the difference between internal commands and external commands?
Is program files x86 64 bit?
Is gnome a shell?
Is it possible to have a deadlock involving only one process?
What is the main difficulty that a programmer must overcome in writing an operating system for a real-time environment?
What is long term scheduler in operating system (os)?
What are page frames?
Explain High Severity and Low Priority with example?
Explain the basic functions of process management.
