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. Polling for an I/O completion is able to waste a large number of CPU cycles if the processor iterates a busy-waiting loop several times before the I/O completes. However if the I/O device is ready for service polling can be much more proficient than is catching and dispatching an interrupt. Explain a hybrid strategy that combines sleeping, polling, and interrupts for I/O device service. For every of these three strategies (pure polling, pure interrupts, hybrid) explain a computing environment in which that strategy is more efficient than is either of the others.
Answer: A hybrid approach could switch among polling and interrupts depending on the length of the I/O operation wait. For instance we could poll and loop N times and if the device is still busy at N+1 we could set an interrupt and sleep. This approach would evade long busy-waiting cycles. This process would be best for very long or very short busy times. It would be incompetent it the I/O completes at N+T (where T is a small number of cycles) because of the overhead of polling plus setting up and catching interrupts.
Pure polling is best with extremely short wait times. Interrupts are best with known long wait times.
how do semaphores help us in eliminating deadlock conditions?
How is a process chosen for being swapped either in or out? Swap out: a. If the process is idle. b. If process has been in main memory for a long time.
Let us consider the operation of the EPROM device in more detail. Consider the pining details below again Before we examine the interface means of the EPROM, it is worth
Define deadlock avoidance. An alternative method for avoiding deadlocks is to need additional information about how resources are to be requested. Every request requires the sy
how to differentiate scheduling algorithms?
Relative file organization A relative file is an array of fixed-length slots and the records can be inserted in the first free slot found from the beginning of the file and
Question: (a) Red Hat Linux is distributed under the Open Source agreement. Explain what you understand by Open Source distribution system. (b) Write a short note on the L
what is data-processing cycle?
Explain the TlsSetValue (TLSindex, dataPtr)Function The TlsSetValue function associates the dataPtr passed as a parameter as local storage for the requesting thread. The asso
a program that can do cpu scheduling algorithm priority using javascript or php to display gaant chart and calculate waiting and average waiting time
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