You have a computer system with 2 CPUs and 2 I/O servers. Assume there are 4 jobs
in the system on average. Draw the state diagram, showing all transitions and labeling
all states. Show how you would set up a system of equations to find the probability of
occupation of each state (but do not solve!)
Distinguish deadlock, livelock, and starvation.
A common scheduling policy in OS is to consider the average length (in CPU cycles) between
resource (or I/O) requests and to schedule first the process with the smallest such
average. Often the average is taken over the last 5-6 intervals between resource requests
only, so as to keep the history "fresh." What goals would such a scheduling policy serve?
For each of the following applications, state whether you would use a software protocol (with
busy waiting), semaphores, monitors, or rendez-vous, and why:
controlling access to a system device (e.g., a DMA channel)