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
- 5240 Views
- I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / 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 |
Answer / anshul bhatnagar
One can not compare the performence for a sheduling
algorithm. as they depends on the use or the requirements
of the system.
for example for one case the FCFC algo can be better and
for the other case the SJF can be benificial.
| Is This Answer Correct ? | 8 Yes | 2 No |
Different types of real-time scheduling?
Explain compaction.
What is the use of Synchronized keyword?
What is normal operating system?
What is interrupt table?
Explain the functions of the cu and alu in the cpu of a computer.
How do I completely remove all traces of a program?
What is lock granularity?
What is a 32 bit system?
Write a function that responds to a click anywhere on the page by displaying an alert dialog. Display the event name if the user held Shift during the mouse click. Display the element name that triggered the event if the user held Ctrl during the mouse click.
When does the condition 'rendezvous' arise?
What are page frames?
Windows 
