Interested to Buy Any Domain ? << Click Here >> for more details...
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
- 6276 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 |
which is best among pipes, queues, shared memory and why?
How do you format a pc?
Mention the steps involved in the execution of a program.
Explain the meaning of kernal.
What is dynamic scheduling in operating system (os)?
What is hard disk?
Differentiate between Complier and Interpreter?
How do I uninstall remnants of uninstalled programs?
What is Thrashing?
What is a real-time system?
7 Answers SureSoft, Verifone, Wipro,
Which is first operating system?
If A>B then F=F(G); else B>C then F=G(G); in this , for 75% times A>B and 25% times B>C then,is 10000 instructions are there ,then the ratio of F to G [a] 7500:2500 [b] 7500:625 [c] 7500:625 if a=b=c else 7500:2500
Windows 
