This Article 
 Bibliographic References 
 Add to: 
Performance Analysis of Transaction Driven Computer Systems Via Queueing Analysis of Polling Models
April 1992 (vol. 41 no. 4)
pp. 455-466

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.

[1] O. J. Boxma, "Workloads and waiting times in single-server systems with multiple customer classes,"Queueing Syst., vol. 5, 1989, pp. 185-214.
[2] O. J. Boxma and W. P. Groenendijk, "Pseudo-conservation laws in cyclic-service systems,"J. Appl. Probability, vol. 25, pp. 949-964, 1987.
[3] O. J. Boxma and B. Meister, "Waiting-time approximations for cyclic-service systems with switch-over times,"Perform. Eval. Rev., vol. 14, pp. 254-262, 1986.
[4] O. J. Boxma and B. Meister, "Waiting-times in multi-queue systems with cyclic service,"Perform. Eval. Rev., vol. 7, pp. 59-70, 1987.
[5] M. J. Ferguson and Y. J. Aminetzah, "Exact results for nonsymmetric token ring systems,"IEEE Trans. Commun., vol. COM-33, pp. 223-231, 1985.
[6] S. W. Fuhrmann and Y. T. Wang, "Mean waiting time approximations of cyclic service systems with limited service," inProc. Performance '87, P.-J. Courtois and G. Latouche, Eds. Amsterdam, The Netherlands: North-Holland, pp. 253-265.
[7] W. P. Groenendijk, "A conservation-law based approximation algorithm for waiting times in polling systems," Rep. Centre for Mathematics and Computer Science, Amsterdam, The Netherlands, 1988.
[8] W. P. Groenendijk, "Waiting-time approximations for cyclic-service systems with mixed service strategies," inProc. 12th ITC. Amsterdam, The Netherlands, 1989.
[9] P. J. Kühn, "Multiqueue systems with nonexhaustive cyclic service,"Bell Syst. Tech. J., vol. 58, pp. 671-698, 1979.
[10] K. K. Leung, "Performance analysis of a processor sharing policy with interactive and background jobs," Rep. AT&T Bell Labs, Holmdel, NJ, 1988.
[11] H. Levy, "Single-processor transaction oriented systems: Modeling and analysis," Rep. AT&T Bell Labs., Holmdel, NJ, 1988.
[12] H. Levy and M. Sidi, "Correlated arrivals in polling systems," inProc. Infocom '89, 1989, pp. 907-913.
[13] H. Levy and M. Sidi, "Customer routing in polling systems," inProc. Performance '90, Sept. 1990.
[14] M. M. Srinivasan, "An approximation for mean waiting times in cyclic server systems with nonexhaustive service,"Perform. Eval., vol. 9, pp. 17-33, 1988.
[15] K. S. Watson, "Performance evaluation of cyclic server strategies--A survey," inProc. Performance '84, E. Gelenbe, Ed., Amsterdam, The Netherlands, 1985, pp. 521-533.
[16] W. Whitt, "Approximations for GI/G/m queue," Rep. AT&T Bell Labs., Murray Hill, NJ, 1985.
[17] R. W. Wolff, "Poisson arrivals see time averages,"Oper. Res., vol. 30, pp. 223-231, 1982.

Index Terms:
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.
W.P. Groenendijk, H. Levy, "Performance Analysis of Transaction Driven Computer Systems Via Queueing Analysis of Polling Models," IEEE Transactions on Computers, vol. 41, no. 4, pp. 455-466, April 1992, doi:10.1109/12.135558
Usage of this product signifies your acceptance of the Terms of Use.