Issue No. 04 - April (1992 vol. 41)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.135558
<p>A class of computer systems whose primary task is the massive processing of batch transitions and which are called transaction-driven computer systems (TDCSs) is modeled and analyzed. A generic queuing model for transaction-driven computer systems is presented, and the mean sojourn time experienced by the different transactions is calculated. The approach is to model a TDCS by a cyclic polling system with bulk arrivals, deterministic service times, limited-one service, and zero switch-over periods. Since the performance analysis of this polling model has not been provided before, the emphasis is on deriving mean delay approximations for it. The analysis is carried out for models with general switch-over periods, and a special case of it (zero switch-over periods) is suitable for analyzing a TDCS.</p>
performance analysis; transaction driven computer systems; queueing analysis; polling models; batch transitions; generic queuing model; mean sojourn time; cyclic polling system; performance evaluation; queueing theory.
H. Levy, W.P. Groenendijk, "Performance Analysis of Transaction Driven Computer Systems Via Queueing Analysis of Polling Models", IEEE Transactions on Computers, vol. 41, no. , pp. 455-466, April 1992, doi:10.1109/12.135558