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
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 |
what is Compiler?
How do I do a system restore?
Explain page fault interrupt?
Given a Pid, how will you distinguish whether it is a process or a thread?
What is the latest version of mint?
difference between 98 & xp?
What is lts in node js?
Will chkdsk fix bad sectors?
What is an Assembler?
What is significance of semaphores? What are the different types of semaphores?
Why is 64 bit called x86?
Which JVM parameter is used to control the stack size of a thread?