Questions from Operating Systems

Q: In a queuing system, new jobs must wait for a while

In a queuing system, new jobs must wait for a while before being served. While a job waits, its priority increases linearly with time from zero at a rate A job waits until its priority reaches the pri...

Q: Consider a set of five aperiodic tasks with the execution profiles of

Consider a set of five aperiodic tasks with the execution profiles of Table 10.8. Develop scheduling diagrams similar to those of Figure 10.6 for this set of tasks. Table 10.8: Figure 10.6:

Q: Least-laxity-first (LLF) is a real-

Least-laxity-first (LLF) is a real-time scheduling algorithm for periodic tasks. Slack time, or laxity, is the amount of time between when a task would complete if it started now and its next deadline...

Q: Repeat Problem 10.3d for the execution profiles of Table 10

Repeat Problem 10.3d for the execution profiles of Table 10.9b. Comment on the results. Data from Problem 10.3d: d. Consider a set of three periodic tasks with the execution profiles of Table 10.9a....

Q: Maximum-urgency-first (MUF) is a real-

Maximum-urgency-first (MUF) is a real-time scheduling algorithm for periodic tasks. Each task is assigned an urgency that is defined as a combination of two fixed priorities and one dynamic priority....

Q: Define the two main categories of processor registers.

Define the two main categories of processor registers.

Q: Repeat Problem 10.4, adding MUF to the diagrams.

Repeat Problem 10.4, adding MUF to the diagrams. Comment on the results. Data from Problem10.4: d. Consider a set of three periodic tasks with the execution profiles of Table 10.9a. Develop scheduling...

Q: This problem demonstrates that although Equation (10.2) for

This problem demonstrates that although Equation (10.2) for rate monotonic scheduling is a sufficient condition for successful scheduling, it is not a necessary condition (i.e., sometimes successful s...

Q: Draw a diagram similar to that of Figure 10.9b that

Draw a diagram similar to that of Figure 10.9b that shows the sequence events for this same example using priority ceiling. Figure 10.9b:

Q: Define residence time Tr as the average total time a process spends

Define residence time Tr as the average total time a process spends waiting and being served. Show that for FIFO, with mean service time Ts, we have Tr=Ts/(1−ρ), where is utilization.