Pick one scheduling algorithm and give us your opinion about it; use different p
ID: 3893613 • Letter: P
Question
Pick one scheduling algorithm and give us your opinion about it; use different points of view (interactive/batch, slow/fast, easy/difficult to implement/understand, etc.)
The post should reflect your own understanding, use your own words (don't repeat paragraphs from the online material or the eReadings).
If you pick an algorithm that was already chosen (and posted) by another colleague, your post should be original (try covering different angles, give some examples, etc.).
OR : Suggest a new scheduling algorithm. Show its advantages and disadvantages.
Explanation / Answer
Answer)
Let us take First come First Serve Scheduling algorithm as an example to define its characteristics.
1) This is easy to be executed as the jobs are given priority based on first come basis.
2) This is non-preemptive scheduling algorithm'
3) Quiet easy to understand as well as implement
4) The implementation is on the basis of FIFO technique
5) Performance is poor as it is having a high average waiting time.
The other algorithms are as follows:
Round Robin, Shortest Remaining time, Shortest job next, priority scheduling, and multi level queue.
Hope this answer helps. Happy to help. :)