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.
SSTF (Shortest Seek Time First) After a demand go to the closest request in the work queue regardless of direction Decrease total seek time compared to FCFS Disadv
what if we need the portion from a text based on some keyword. For eg. My file is like below, ------------------------------------------------ Order=[ 1 2 3 4 5 Order=[ 6 7 8 9
Explain multilevel queue scheduling and multilevel feedback queue scheduling #Minimum 100 words accepted#
What is independent process? A process is independent it cannot influence or be affected by the other processes implementing in the system. Any process does not share data with
Q. Illustrate the function of Loader? A loader is a routine which loads an object program and prepares it for execution. There are many loading schemes: relocating, absolute an
OPERATING SYSTEM 1. Describe the term operating system. Write down the functions of operating system. 2. Explain Thread? Write down the advantages and disadvantages of threa
Short term scheduling The short term scheduler as well known as the dispatcher executes most frequently and makes the fine grained decision of which process to execute next. Th
Direct memory access Many computers avoid burdening the main CPU with programmed I/O by offloading sine if this work to a special-purpose processor known as a direct memory add
Now let's implement bounded producer-consumer with semaphores, a Coke machine which is initially empty: semaphore sem_mutex = 1 // binary semaphore for mutual exclusion, 1==unlo
Note for assignment
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