January 2021

1.Name five major activities of an OS with respect to process management, and brieflydescribe why each is required. 2.Consider a computer with N processors in a multiprocessor configuration. a. How many processes can be in each of the Ready, Running, and Blocked states at one time? b. What is the minimum number of processes that […]

In Section 3.4, it was stated that UNIX is unsuitable for real-time applications because a process executing in kernel mode may not be preempted. Elaborate. 4.1 Table 3.5 lists typical elements found in a process control block for an unthreaded OS. Of these, which should belong to a thread control block and which should belong

1.List reasons why a mode switch between threads may be cheaper than a mode switch between processes. 2. What are the two separate and potentially independent characteristics embodied in the concept of process? 3. Give four general examples of the use of threads in a single-user multiprocessing system. 4. What resources are typically shared by

1.List two disadvantages of ULTs compared to KLTs. 2. Define jacketing. 3. Briefly define the various architectures named in Figure 4.8. 4. List the key design issues for an SMP operating system. 5. Give examples of services and functions found in a typical monolithic OS that may be external subsystems to a microkernel OS. 6.

1.Explain the potential performance disadvantage of a microkernel OS. 2. List three functions you would expect to find even in a minimal microkernel OS. 3. What is the basic form of communications between processes or threads in a microkernel OS? 4. In the discussion of ULTs versus KLTs, it was pointed out that a disadvantage

1.If a process exits and there are still threads of that process running, will they continue to run? LEWI96-42 2. The OS/390 mainframe operating system is structured around the concepts of address space and task. Roughly speaking, a single address space corresponds to a single application and corresponds more or less to a process in

Now consider a version of the without the variable choosing. Then we have int number[n]; while (true) number[i] = 1 + getmax(number[], n); for (int j = 0; j < n;=””> while ((number[j] != 0) && (number[j],j) < (number[i],i))=”” =””> /* critical section */; number [i] = 0; /* remainder */; Does this version violate

1.Another atomic machine instruction that supports mutual exclusion that is often mentioned in the literature is the test&set instruction, defined as follows: boolean test_and_set (int i) if (i == 0) i = 1; return true; else return false; Define a procedure similar to those of Figure 5.2 that uses the test&set instruction. 2. It should

In the commentary on Figure 5.9 and Table 5.4, it was stated that “it would not do simply to move the conditional statement inside the critical section (controlled by s) of the consumer because this could lead to deadlock.” Demonstrate this with a table similar to Table 5.4. 5.21 Consider the solution to the infinite-buffer

1.Consider Figure 5.13.Would the meaning of the program change if the following were interchanged? a. semWait(e); semWait(s) b. semSignal(s); semSignal(n) c. semWait(n); semWait(s) d. semSignal(s); semSignal(e) 2. In the discussion of the producer/consumer problem with finite buffer (Figure 5.12), note that our definition allows at most n – 1 entries in the buffer. a. Why is this?