Illustrate the handshaking protocol, Operating System

Assignment Help:

Q. The instance of handshaking used 2 bits: a busy bit as well as a command-ready bit. Is it probable to implement this handshaking with only 1 bit? If it is illustrate the protocol. If it isn't explain why 1 bit is insufficient.

Answer: It is probable using the following algorithm. Let's presume we simply use the busy-bit (or the command-ready bit this answer is the similar regardless). While the bit is off the controller is idle. The host writes to data-out as well as sets the bit to signal that an operation is readies (the equivalent of setting the command-ready bit). While the controller is finished it clears the busy bit. The host then commence the next operation.

This solution necessitates that both the host and the controller have read and write access to the same bit which can complicate circuitry and increase the cost of the controller.


Related Discussions:- Illustrate the handshaking protocol

Describe demand-paged environment, Q. Which of the subsequent programming ...

Q. Which of the subsequent programming techniques and structures are good for a demand-paged environment? Which aren't good? Describe your answers. a. Stack b. Hashed symbol

What are the advantages of using unequal- size partitions, In fixed portion...

In fixed portioning scheme, what are the advantages of using unequal- size partitions? With unequal-size partitions there are two probable ways to assign process to partitions.

Explain process states in the unix system, Process States A total of n...

Process States A total of nine states are acknowledged by the UNIX system. They are like as follow: User running                                                   Executing

Explanation of computer clustering and benefits, The CTO is still impressed...

The CTO is still impressed with your work. He just came back from a technology exposition where he heard about computer clusters. All he knows is that they are the big thing for bu

What is starvation?, What is starvation? A main problem related to dead...

What is starvation? A main problem related to deadlock is starvation. Starvation is the circumstances where process waits indefinitely within the semaphore. Indefinite blocking

Name two differences between logical and physical addresses, Q. Name two di...

Q. Name two differences between logical and physical addresses? Answer: A logical address doesn't refer to an actual existing address rather it refers to an abstract address in

Explain fifo page replacement, FIFO page replacement This is the easie...

FIFO page replacement This is the easiest page replacement algorithm. At this juncture the 1 st page entering is the 1 st to leave that is the oldest page leaves. To execute

What are the advantages of multi threading?, What are the advantages of mul...

What are the advantages of multi threading?  Multithreading a code can have several advantages. Improve application responsiveness --Any program in which var

Virtual memory, In modern operating systems, applications do not directly a...

In modern operating systems, applications do not directly access the physical memory. Instead, they use so-called virtual memory, where each virtual address is translated to a phys

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd