By Topic

Performance analysis of transaction driven computer systems via queueing analysis of polling models

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Groenendijk, W.P. ; Shell Lab., Amsterdam, Netherlands ; Levy, H.

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

Published in:

Computers, IEEE Transactions on  (Volume:41 ,  Issue: 4 )