Problem 1. Architecture: One CPU and a hard disk HD. Problem 2. Architecture: On

Question

Problem 1. Architecture: One CPU and a hard disk HD.

Problem 2. Architecture: One CPU, a hard disk HD, and one serial port SER.

Problem 3.Architecture: Two CPUs CPU1 and CPU2, a hard disk HD, and one serial port SER.

With the scheduling scheme utilized in problems 1 through 3, is it possible to construct a process that will starve (i.e., never get a chance to access a resource needed in order to complete a job)? If so, construct a set of processes in which one of them staves. If not, explain why.

Explanation / Answer

The Scheduling scheme utilized in problems 1 through 3 is non preemptive round robin algorithm. In this scheme every resorce will have its FIFO queue which will determine which process will have the right to use that resource at a particular point of time. The process that wants to use a resource will get added to the FIFO queue of that resorce and when all the processes that are present in the queue before get served, it will get its chance to use the resource.

Now in the real time every process will utilize a resource for a finite amount of time, thus it can be concluded that every request of the process for any resource will get served in the finite amount of time ( asalso there is no priority assigned to any process and no preemption is there).

Hence the above algorithm completely avoids the possibility of starvation.

Hope this helps

Any query please do comment

Related Questions

Navigate

• Browse (All)
• Browse P
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.