A computer has an average interrupt response time of p, takes q to process an interrupt, and

Question:

A computer has an average interrupt response time of p, takes q to process an interrupt, and takes s to return from interrupt. If a polled interrupt mechanism is implemented and takes x to poll a device and y to service a device that interrupted, how many devices can be polled before polling becomes less efficient than an interrupt-driven 1/0?  

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Question Posted: