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
- 6364 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
Can I upgrade my cpu from 32 to 64 bit?
How can the speed of interrupt driven input output systems be improved?
What is run level 1?
What are differences between ram and rom?
Which event determines that all the controls are completely loaded into memory?
Why is it called program files x86?
Measurements of a certain system have shown that the
average process runs for a time T before blocking
on I/O. A process switch requires a time S, which is
effectively wasted (overhead). The CPU’s efficiency is
the fraction of its time its spends executing user
programs, i.e., executing user processes. For round robin
scheduling with quantum Q, give a formula for the CPU
efficiency for each of the following:
(a) Q = ∞
(b) Q > S + T
(c) S Do 64 bit applications use more memory? What is the difference between tty and pts? How to take backup using active directory recyclebin concept
Explain about Different types of real-time scheduling? What are pages? Is vmware an operating system? What is a layered approach and what is its advantage? Explain mutant in operating system (os)?
