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
- 6270 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 |
How do you exit a screen?
What is the full form itc?
Explain demand paging, page fault interrupt, and trashing?
How are server systems classified?
Explain the difference between demand-paging and pre-paging?
What are real-time systems?
What are a trap and trapdoor?
Can I use chkdsk on ssd?
How does Windows NT supports Multitasking?
How you can Kill the Session by force?
Explain turnaround time and response time?
Where is the root directory?
Windows 
