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


Please Help Members By Posting Answers For Below Questions

How much ram do I need?

674


Why paging is used in os?

794


Describe the objective of multiprogramming.

1137


Considering notepad/IE or any other thing as process, What will happen if you start notepad or IE 3 times ? Where three processes are started or three threads are started?

995


Is non-pre-emptive scheduling frequently used in a computer? Why?

754


What are different tasks of lexical analysis?

844


Stable storage cannot be implemented. (A) Explain why it cannot be. (B) Explain how database system deal with database applications

1974


What is dining philosophers’ problem?

790


What is the maximum ram for a 64 bit operating system?

752


Is 32 bit obsolete?

750


Can I use chkdsk on ssd?

752


What is eide?

907


Explain the reasons for process suspension?

814


How much ram do I need for excel?

759


What are a trap and trapdoor?

832