Operating System



Item Name

Consider a hierarchical deadlock-detection algorithm in which th

Consider a hierarchical deadlock-detection algorithm in which the global wait-for graph is distributed over a number of different controllers, which are organized in a tree. Each non-leaf controller maintains a wait-for graph that contains relevant information from the graphs of the controllers in the sub tree below it. In particular, let SA, SB, and SC be controllers such that SC is the lowest...

Consider a logical address space of 32 pages with 1,024

Consider a logical address space of 32 pages with 1,024 words per page, mapped onto a physical memory of 16 frames. a. How many bits are required in. the logical address? b. How many bits are required in the physical address?

Consider a logical address space of 64 pages of 1,024

Consider a logical address space of 64 pages of 1,024 words each, mapped onto a physical memory of 32 frames. a. How many bits are there in the logical address? b. How many bits are there in the physical address?

Consider a multiprocessor system and a multithreaded program wri

Consider a multiprocessor system and a multithreaded program written using the many-to-many threading model. Let the number of user-level threads in the program be more than the number of processors in the system. Discuss the performance implications of the following scenarios. a. The number of kernel threads allocated to the program is less than the number of processors. b. The number of kernel...

Consider a network layer that senses collisions and retransmits

Consider a network layer that senses collisions and retransmits immediately on detection of a collision. What problems could arise with this strategy? How could they be rectified?

Consider a paging system with the page table stored in

Consider a paging system with the page table stored in memory. a. If a memory reference takes 200 nanoseconds, how long does a paged memory reference take? b. If we add TLBs, and 75 percent of all page-table references are found in the TLBs, what is the effective memory reference time? (Assume that finding a page-table entry in the TLBs takes zero time, if the entry is there.)

Consider a preemptive priority scheduling algorithm based on dyn

Consider a preemptive priority scheduling algorithm based on dynamically changing priorities. Larger priority numbers imply higher priority. When a process is waiting for the CPU (in the ready queue, but not running), its priority changes at a rate α; when it is running, its priority changes at a rate β All processes are given a priority of 0 when they enter the ready queue. The parameters α...

Consider a RAID level 5 organization comprising five disks,

Consider a RAID level 5 organization comprising five disks, with the parity for sets of four blocks on four disks stored on the fifth disk. How many blocks are accessed in order to perform the following? a. A write of one block of data b. A write of seven continuous blocks of data

Consider a system consisting of four resources of the same

Consider a system consisting of four resources of the same type that are shared by three processes, each of which needs at most two resources. Show that the system is deadlock free.

Consider a system consisting of m resources of the same

Consider a system consisting of m resources of the same type being shared by n processes. A process can request or release only one resource at a time. Show that the system is deadlock free if the following two conditions hold: a. The maximum need of each process is between one resource and m resources. b. The sum of all maximum needs is less than m + n.