Exercises on process scheduling

Assuming there are many processes sharing computer resources on one computer.

(1) Explain how First-come First-serve (FCFS) scheduling logic works; give an example and list the

advantages and disadvantages of FCFS scheduling.

(2) Explain how priority-based scheduling logic works; give an example and list the advantages and

disadvantages of this scheduling.

(3) Explain how time-slice based (or Round Robin) scheduling logic works; give an example and list

the advantages of this scheduling.

(4) Give an example to show how (1) and (3) are used together to improve the performance of

processes.

(5) Give an example to show how (2) and (3) are used together to improve the performance of

processes.

(6) Who can manage (to change priority of a process; to terminate anyones process if it is looping

indefinitely) all the processes in a multi-tasking system?

(7) Name OS processes that need be run before any users process.