1 / 10

G5 3OPS Operating Systems

G5 3OPS Operating Systems. Q3 2000 Exam. Graham Kendall. 3a Describe the following scheduling algorithms. Non Pre-Emptive, First Come, First Serve

zody
Download Presentation

G5 3OPS Operating Systems

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. G53OPSOperating Systems Q3 2000 Exam Graham Kendall

  2. 3a Describe the following scheduling algorithms • Non Pre-Emptive, First Come, First Serve An obvious scheduling algorithm is to execute the processes in the order they arrive and to execute them to completion. In fact, this simply implements a non-preemptive scheduling algorithm. It is an easy algorithm to implement. When a process becomes ready it is added to the tail of ready queue. This is achieved by adding the Process Control Block (PCB) to the queue. When the CPU becomes free the process at the head of the queue is removed, moved to a running state and allowed to use the CPU until it is completed. The problem with FCFS is that the average waiting time can be long.

  3. 3a Describe the following scheduling algorithms • Round Robin The processes to be run are held in a queue and the scheduler takes the first job off the front of the queue and assigns it to the CPU (so far the same as FCFS). In addition, there is a unit of time defined (called a quantum). Once the process has used up a quantum the process is preempted and a context switch occurs. The process which was using the processor is placed at the back of the ready queue and the process at the head of the queue is assigned to the CPU. Of course, instead of being preempted the process could complete before using its quantum. This would mean a new process could start earlier and the completed process would not be placed at the end of the queue (it would either finish completely or move to a blocked state whilst it waited for some interrupt, for example I/O). The average waiting time using RR can be quite long.

  4. 3a Describe the following scheduling algorithms • Shortest Job First Using the SJF algorithm, each process is tagged with the length of its next CPU burst. The processes are then scheduled by selecting the shortest job first. In fact, the SJF algorithm is provably optimal with regard to the average waiting time. And, intuitively, this is the case as shorter jobs add less to the average time, thus giving a shorter average. The problem is we do not know the burst time of a process before it starts. For some systems (notably batch systems) we can make fairly accurate estimates but for interactive processes it is not so easy.

  5. P3 Process P6 P1 P2 P5 P7 P4 23 Burst Time 10 6 3 9 31 19 3b Given the following processes and burst times Calculate the average waiting time when each of the above scheduling algorithms is used. Assume a quantum of 8 is being used

  6. Process Burst Time Wait Time P1 10 0 P2 6 10 P3 23 16 P4 9 39 P5 31 48 P6 3 79 P7 19 82 3b Given the following processes and burst times (FCFS) (0 + 10 + 16 + 39 + 48 + 79 + 82) / 7 = 274/7 = 39.14

  7. Process Wait Times Burst Time 41 P1 10 8 P2 6 60 P3 23 51 P4 9 70 P5 31 38 P6 3 75 P7 19 P3 P3 P5 P6 P2 P7 P4 P5 P1 P4 P5 P7 P3 P7 P5 P1 8 8 8 8 3 1 8 8 8 8 2 7 3 7 6 8 3b Given the following processes and burst times (Round Robin) 0 0 2 41 0 8 15 0 14 29 7 17 1 29 0 22 23 7 15 0 30 15 3 22 38 0 11 0 41 15 3 19 343 / 7 = 49.00

  8. Process Process Burst Time Burst Time Wait Time P1 P6 10 3 0 P2 P2 6 6 3 P4 P3 9 23 9 P4 P1 10 9 18 P7 P5 19 31 28 P6 P3 23 3 47 P5 P7 31 19 70 3b Given the following processes and burst times (SJF) (0 + 3 + 9 + 18 + 28 + 47 + 70) / 7 = 175/7 = 25.00

  9. 3c Which Scheduling Algorithm, as an operating systems designer, would you implement This is an opportunity for the student to give their views on scheduling algorithms. As we discussed in the lectures there is no ideal scheduling algorithm, there are always trade offs and compromises. No marks will be awarded for saying shortest job first (SJF) would be implemented (as this is not possible), but an algorithm that estimates the burst time, so that SJF can be partially emulated would get some marks. I would also give marks for saying that multi-level feedback queue scheduling would be a good choice as, by varying the parameters to this algorithm, it is possible to emulate all the other algorithms we considered. But the student should also say that even this is not ideal as vast amounts of testing and guesswork would still be needed. All implementing this algorithm does is give you the flexibility to try various algorithms. Many other answers are possible and the marks will be awarded on the basis of their argument and how they defend it.

  10. G53OPSOperating Systems Q3 2000 Exam Graham Kendall

More Related