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
- 5613 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 |
Why is 32 bit called x86 and not x32?
What is the difference between tty and pts?
Explain about Different types of real-time scheduling?
Explain the trda?
How do I find my hidden files?
What is authentication in operating system?
How does agile communication differ from tradition software engineering communication? How it is similar?
What is the best page size when designing an operating system?
What problems are faced during the implementation of a network-transparent system?
What are the major differences between Thread and Process?
How much ram can you have on a 64 bit system?
What are turnaround time and response time?
6 Answers IBM, Maveric, TCS, WUB,
Windows 
