A stochastic model of closed-loop priority I/O systems is developed in which request generation is assumed to be exponential but service time distributions are arbitrary. This model reflects the code granularity caused by the implementation. Using this model, an interrupt-driven system is compared to a similar system with polled I/O on the basis of latency times and CPU utilization.