Please answer these questions, thank you! Let us assume that a series of reader
ID: 3774672 • Letter: P
Question
Please answer these questions, thank you!
Let us assume that a series of reader and writer processes only use reader-writer locks for synchronization. Explain how deadlock is still possible (refer back to the four necessary conditions of deadlock) if multiple reader-writer locks are being used. 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. Use the banker's algorithm to show the system is deadlock free. Consider a computer system with a 32-bit logical address and 2-KB page size. The system supports up to 1 GB of physical memory. How many entries are there in each of the following? You must express your answer in terms of powers of 2 (otherwise, it will be marked wrong even if it is correct). (a) A conventional single-level page table? (b) An inverted page table?Explanation / Answer
1.Deadlock is still possible if multiple reader -writer locks are being used because these read-erwriter locks will cause
mutual exclusion because all processes with be able to share resources simultanously.Moreoever there will be
no-preemption which means that processes will not have resource being taken away while the resource is being
used in this case.
It also leads to circular waiting due to these lock and moreover in this case a circular chain of processes, with each
process holding resources which are currently being requested by the next process in the chain, cannot exist.
Moreover,If it does, the cycle theorem indicates that deadlock can occur due to multple reader-writer locks.