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 |
How do you sleep in python?
what is Loader?
4 Answers Indian Railways, Net Access, Network Labs, RRB,
what are LRU, LFU in the OS concepts? How they are useful in the scheduling?
Are 64bit applications faster?
Difference between Primary storage and secondary storage?
Which is better internet explorer or edge?
Explain what is meant by repetition of information and inability to represent information. Explain why each of these properties may indicate a bad relational database design.
What are rings in Windows NT?
How do I search all files in windows?
Differentiate between pre-emptive and non-pre-emptive scheduling.
0 Answers Akamai Technologies,
What resources are used when a thread created? How do they differ from those when a process is created?
Why is interrupt vector used in operating systems?