A bridge on a busy highway is damaged by a flood. One-way traffic is t

Back to the 2022 paper

Module 3: Inter-process Communication

202214m

A bridge on a busy highway is damaged by a flood. One-way traffic is to be instituted on the bridge by permitting vehicles traveling in opposite directions to use the bridge alternately. The following rules are formulated for use of the bridge:
(a) At any time, the bridge is used by vehicle(s) traveling in one direction only.
(b) If vehicles are waiting to cross the bridge at both ends, only one vehicle from one end is allowed to cross the bridge before a vehicle from the other end starts crossing the bridge.
(c) If no vehicles are waiting at one end, then any numbers of vehicles from the other end are permitted to cross the bridge.
Develop a concurrent system to implement these rules.

Search Google Ask AI

Similar questions

Computer NetworksWhat is the role of a bridge?20152m Computer NetworksWhat is bridge? Explain about spanning tree.20158m Computer NetworksDescribe bridge in terms of networking device. What are different types of network bridge?20177m Computer NetworksWhat are the advantages of dividing an Ethernet LAN with a bridge?20172m

PreviousFive batch jobs, A through E, arrive at a computer center at essentially the same time. They have an estimated running time of 15, 9, 3, 6 and 12 minutes, respectively. Their (externally defined) priorities are 6, 3, 7, 9 and 4, respectively, with a lower value corresponding to a higher priority. For each of the following scheduling algorithms, determine the waiting time for each process and the average waiting for all jobs. Ignore process switching overhead. Explain how you arrived at your answers. In the last three cases, assume that only one job at a time runs until it finishes and that all jobs are completely processor bound: (a) Priority scheduling (b) FCFS (run in order 15, 9, 3, 6 and 12) (c) Shortest job first NextConsider a simple paging system with the following parameters: * 2^32 bytes of physical memory * Page size of 2^10 bytes * 2^16 pages of logical address space (i) How many bits are in a logical address? (ii) How many bytes are in a frame? (iii) How many bits in the physical address specify the frame? (iv) How many entries are in the page table?