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
- 5679 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
How much ram do I need?
Why paging is used in os?
Describe the objective of multiprogramming.
Considering notepad/IE or any other thing as process, What will happen if you start notepad or IE 3 times ? Where three processes are started or three threads are started?
Is non-pre-emptive scheduling frequently used in a computer? Why?
What are different tasks of lexical analysis?
Stable storage cannot be implemented. (A) Explain why it cannot be. (B) Explain how database system deal with database applications
What is dining philosophers’ problem?
What is the maximum ram for a 64 bit operating system?
Is 32 bit obsolete?
Can I use chkdsk on ssd?
What is eide?
Explain the reasons for process suspension?
How much ram do I need for excel?
What are a trap and trapdoor?
