In a non-preemptive uni-processor system, the ready queue contains three jobs at time t immediately after the completion of a job. These jobs arrived at times t1, t2, and t3 with estimated execution times of r1, r2, and r3, respectively. Figure shows the linear increase of their response ratios over time. Use this example to find a variant of response ratio scheduling, known as minimax response ratio scheduling, that minimizes the maximum response ratio for a given batch of jobs ignoring further arrivals.
Answer to relevant QuestionsProve that the minimax response ratio algorithm of the preceding problem minimizes the maximum response ratio for a given batch of jobs. An interactive system using round-robin scheduling and swapping tries to give guaranteed response to trivial requests as follows: After completing a round-robin cycle among all ready processes, the system determines the time ...List and briefly define five general areas of requirements for a real-time operating system. Repeat Problem 10.4, adding MUF to the diagrams. Comment on the results. Consider a set of three periodic tasks with the execution profiles of Table 10.9a. Develop scheduling diagrams similar to those of Figure for this set ...a. Perform the same type of analysis as that of Table for the following sequence of disk track requests: 27, 129, 110, 186, 147, 41, 10, 64, 120. Assume that the disk head is initially positioned over track 100 and is moving ...
Post your question