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
- 6149 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 |
when a process is created using fork(). what is shared between parent process and child process. 1.Heap 2. stack 3. shared memory segments 4. I/O handles
2 Answers Hyderabad Central University, nvidia,
Is 100 cpu usage bad?
Explain briefly about processor and its functioning?
what are the softwares helping for auditing poblems?
What kind of memory is a ram categorized as?
What advantage is there in having different time-quantum sizes on different levels of a multilevel queuing system?
What is shadow ram?
What is the Translation Lookaside Buffer (TLB)?
Define multics?
What is spooling? and What is spooled device? Give the examples for the spooled devices?
When does the belady's anomaly occur?
How does reference counting manage memory allocated objects? When can it fail to reclaim objects?
Windows 
