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
Draw the states of a process in an OS.
How to stop running thread?
What is the difference between 32 bit and 64 bit os?
How do I force a program to close?
How do I search for excel files on my computer?
How does thread synchronization occur in a monitor?
Explain what is a semaphore?
Explain about Different types of real-time scheduling?
What is synchronously and asynchronously?
How can the FCFS scheduling be made better?
Can I change from 32 bit to 64 bit?
Why do we use semaphore?
What causes a page fault?
Describe Banker’s algorithm
What is the purpose of an I/O status information?