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 are the key object oriented concepts used by Windows NT?
Can you move program files from c to d?
Can I have two browsers on my computer?
Explain paging, faulting, and deadlock?
0 Answers Tavant Technologies, Thomson Reuters, Verifone, Visa,
How do I see all files on my mac?
What is medium term scheduling in operating system (os)?
Different types of real-time scheduling?
Draw the states of a process in an OS.
What join() method does?
Does a clean install erase everything?
in which situation we use sjf scheduling algorithem??
Suppose if we have a variable 'I' in run method, if I can create one or more thread each thread will occupy a separate copy or same variable will be shared?