Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
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.
function of lazy swapper
with the aid of diagrams describe the following os structures monolithic , layered, client server
What is preemptive and nonpreemptive scheduling? Under nonpreemptive scheduling once the CPU has been allocated to a process, the process keeps the CPU unless it releases the C
What is the use of fork and exec system calls? Fork is a system call by which a latest process is created. Exec is also a system call, which is used after a fork by one of the
Discuss the high barriers to entry in the market for PL operating systems
Consider a particular system that does not have an interrupting clock. The only way a thread can lose the processor is to voluntarily surrender it. Additionally, the operating sy
Define the Programming Fundamentals for Client- Server Developers Coding for client - server enforces good programming fundamentals. In order for applications to become client
Explain about deadlock detection? In deadlock situation, the system must provide An algorithm that verifies the state of the system to verify whether a deadlock has occu
Why is it not possible to enforce memory protection at compile time? Every process should be protected against unwanted interference by other process, whether intentional or
Define lazy swapper. Rather than swapping the entire process into main memory, a lazy swapper is used. A lazy swapper never swaps a page into memory unless that page will be ne
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!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd