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
Answer Posted / 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 |
Post New Answer View All Answers
Explain Page Segmentation.
How the Kernel handles both the page stealer and the fault handler?
How does the cpu and the ram communicate?
Will my laptop run faster with more ram?
Name the different types of memory?
Command Kill any user’s all processes.
Difference between a thread and process?
What are the different types of process termination?
Give an example of a Process State.
What is virtual memory and where it exhist ?
What is the Difference between Loading and Linking ?
Explain Marshalling?
Briefly explain FCFS.
What are types of file?
How do I remove prime os from my pc?