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 slice to allocate to each
Ready process for the next cycle by dividing a maximum response time by the number of processes requiring service. Is this a reasonable policy?
Answer to relevant QuestionsFive batch jobs, A through E, arrive at a computer center at essentially the same time. They have an estimated running time of 15, 9, 3, 6, and 12 minutes, respectively. Their (externally defined) priorities are 6, 3, 7, 9, ...What is the difference between periodic and aperiodic real-time tasks? Repeat Problem 10.3d for the execution profiles of Table 10.9b. 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 ...Briefly define the disk scheduling policies illustrated in Figure. A 32-bit computer has two selector channels and one multiplexor channel. Each selector channel supports two magnetic disk and two magnetic tape units. The multiplexor channel has two line printers, two card readers, and ten ...
Post your question