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.
What is Single-level Directory All files are constrained in the similar directory, which is simple to support and understood. One limitation is when the number of files enhance
What are three conditions that a solution for the critical section problem must satisfy? The three conditions are as following:- a) Mutual exclusion :- if a process is
Q. Presume that you have coded the deadlock-avoidance safety algorithm as well as now have been asked to implement the deadlock-detection algorithm. Can you do thus by simply usin
examples of classification of models
what is application software?
What is Data Warehouse?
In the mean while the fork() system call the Kernel creates a copy of the parent process's address space and adds it to the child process. But the vfork() system call do no
Q. Why is rotational latency typically not considered in disk scheduling? How would you alter SSTF, SCAN and C-SCAN to comprise latency optimization? Answer: Most disks don't
What is graceful degradation? In multiprocessor systems, failure of single processor will not halt the system, but only slow it down by sharing the work of failure system by ot
Now let us present an implementation of a producer-consumer system using condition variables. This implementation works. dequeue() lock(A) while (queue empty) { wait(A, C)
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