Q2) Design a minimum state HLSM that manages access to a road that is under construction. Maximum 10 cars can pass in any one direction at a time, when there are cars waiting on the other side. • The system starts in the IDLE state • CARS LEFT =1 if there are cars on the left side waiting to pass • CARS_RIGHT = 1 if there are cars on the right side waiting to pass • If cars arrive simultaneously on the left and on the right at the same time, the cars on the right go first. • Only one car is allowed on the road at a time. • If 10 cars have passed in one direction and there are no cars waiting on the other side, direction shouldn't be changed until a car arrives on the other side. (a) Draw the HLSM to represent the above system. (b) Draw the circuit representing the data-path of this system. (c) Draw the control unit and connect it to the data-path with correct labeling.

Q2) Design a minimum state HLSM that manages access to a road that is under construction. Maximum 10 cars can pass in any one direction at a time, when there are cars waiting on the other side. • The system starts in the IDLE state • CARS LEFT =1 if there are cars on the left side waiting to pass • CARS_RIGHT = 1 if there are cars on the right side waiting to pass • If cars arrive simultaneously on the left and on the right at the same time, the cars on the right go first. • Only one car is allowed on the road at a time. • If 10 cars have passed in one direction and there are no cars waiting on the other side, direction shouldn't be changed until a car arrives on the other side. (a) Draw the HLSM to represent the above system. (b) Draw the circuit representing the data-path of this system. (c) Draw the control unit and connect it to the data-path with correct labeling.

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Similar questions

An operating system has three user processes, and each of these processes consumes two units of the resource R. The operating system consumes a total of twelve units via R. The absolute minimum number of R units required to preclude the chance of deadlocks occurring is
14. Au A program is run on a system with two types of machine language instructions: type A instructions each require 3 clock cycles, while type B instructions each require 1 clock cycle. If 100 million type A instructions and 400 million type B instructions are executed, what is the CPI for this program? A program is run on a system with two types of machine language instructions: type A instructions each require 3 clock cycles, while type B instructions each require 1 clock cycle. If 100 million type A instructions and 400 million type B instructions are executed, what is the CPI for this program?.
An operating system uses a total of two units of the resource R for each of its three user processes. The operating system uses a total of 12 units of R. The absolute minimum number of R units that must be used to guarantee that there are no deadlocks is
A single-CPU system has four processes, P1, P2, P3 and P4 in the ready queue. The execution times and I/O needs for these processes are given below. All times are in ms. (hint: when a process starts an IO operation, it is removed from the ready queue and put back at the end of the queue only when it completes its IO). Process P1: Arrives at 0ms, needs 23ms of CPU time. Performs I/O for 5ms after 10ms of its execution time, then another 5ms after 20ms of its execution time. Process P2: Arrives at 3ms, needs 12ms of CPU time. Performs I/O for 10ms after 5ms of its execution time. Process P3: Arrives at 1ms, needs 15ms of CPU time. Performs I/O for 1ms after 7ms of its execution time. Process P4: Arrives at 2ms, needs 8ms of CPU time. Performs I/O for 5ms after 4ms of its execution time. We assume that the CPU is idle if no one of these four processes is using it. Using Round Robin scheduling algorithm with a Time Quantum of 4ms and ignoring the context switch time, determine: a) The…
Operating System: Consider a demand-paging system with a paging disk. The average disk access time is 10 milliseconds, and the average memory access time is 100 nanoseconds. Assume 0.1 percent of the access causes page faults. What is the effective memory access time? In order to achieve no more than 5 percent overhead due to demand paging for this system, what should the maximum page fault rate be?
Producer-consumer problem is a common paradigm for cooperating processes. A producer process produces information that is consumed by a consumer process. One solution to the producer-consumer problem uses shared memory. To allow producer and consumer processes to run concurrently, there must be available a buffer of items that can be filled by the producer and emptied by the consumer. This buffer will reside in a region of memory that is shared by the producer and consumer processes. A producer can produce one item while the consumer is consuming another item. The producer and consumer must be synchronized, so that the consumer does not try to consume an item that has not yet been produced. Write a bash script to simulate producer-consumer problem using semaphores.
Q3: Suppose there is a processing unit composed by CPU and I/O component. For a specific task, CPU takes 5 second to finish the execution and I/O takes 2 second to process. The communication time between CPU and I/O can be elimiate under this circumstance. Execution Time 7 second 5second 2 second CPU time I/O time If CPU time decreases by 25% per year for 3 years and I/O time decreases by 20% per year 1) How many times faster is this program after 3 years? 2) What percentage of new time is I/O? and what percentage of new time is CPU?
An operating system has three user processes, and each of these processes consumes two units of the resource R. The operating system consumes a total of twelve units via R. The absolute minimum number of R units required to preclude the chance of deadlocks occurring is