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.
Determining the time quantum for a job is a critical task. Given the assumptions that the average switching time between processes is s, and the average amount of time an I/O bo
Processes have valid and invalid entries on their page tables. The valid entries all point to some where "real" (e.g. a physical page, or some portion of disk in case of non-reside
See attachemnt
Explain segmentation hardware? We define an completion to map two-dimensional user-defined addresses into one-dimensional physical addresses. This mapping is affected by means
Ask question #Minimum 150 words
BEST FIT ALGORITHM Here scanning is for the finest fit one. Signifies it searches the entire list for the best fit position. For the process therefore in that the process will
Question: Concurrency and Synchronization a) Define the following terms: I. Critical section II. Mutual Exclusion III. Deadlock IV. Starvation. b) Name three methods w
BENEFITS OF THREADS OVER PROCESS If implemented correctly after those threads have some advantages of (multi) processes, they take: 1. Less time to create a new thread tha
Parent process P creates three child processes, C1, C2, and C3. Each child process executes a memory and CPU intensive application of your choice. Your choice should be such that
The optimal replacement policy, called OPT, is to evict the page which will be accessed farthest into the future. Since we can't predict the future precisely, we can't implement OP
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