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 |
What are the different tasks of Lexical analysis?
How many jobs can be run concurrently on MVT?
Explain about compiler and the functions executed by them?
What is tras timing?
What are the deadlock avoidance schemes?
RAM chips arranged in 4X6 array and of 8kX4bit capacity each. How many address lines reqd. to access each byte a. 12 b. 16 c.15 d. 17
Enumerate the different RAID levels.
What is Difference between thread and process?
28 Answers AirTies, Azingo, Bloomberg, Encora, Goldman Sachs, HCL, HP, MES, Microsoft, Samsung,
Explain the key object oriented concepts used by windows nt?
What is gang scheduling in operating system (os)?
Can you tell me the difference between semaphore and mutex.
What is the difference between shared memory and distributed memory?