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 |
List advantages and disadvantages of dynamic memory allocation vs. static memory allocation.?
How does swapping result in better memory management?
What are the 4 types of communication?
How do I turn off programs running in the background?
What is MUTEX ?
How do I scan a usb drive for errors?
Draw the states of a process in an OS.
What are the various capacities in which a ram is available?
Is there a 86 bit operating system?
What is a rootkit virus?
Name the functions constituting the os's memory management.
What are the different tasks of Lexical analysis?