Waiting-time approximations in multi-queue systems with cyclic service
Performance Evaluation
An approximation for mean waiting times in cyclic server systems with nonexhaustive service
Performance Evaluation
Workloads and waiting times in single-server systems with multiple customer classes
Proceedings of the workshop held at the Mathematical Sciences Institute Cornell University on Mathematical theory of queueing systems
Waiting-time approximations for cyclic-service systems with switch-over times
SIGMETRICS '86/PERFORMANCE '86 Proceedings of the 1986 ACM SIGMETRICS joint international conference on Computer performance modelling, measurement and evaluation
Performance Evaluation of Cyclic Service Strategies - A Survey
Performance '84 Proceedings of the Tenth International Symposium on Computer Performance Modelling, Measurement and Evaluation
Mean Waiting Time Approximations of Cyclic Service Systems with Limited Service
Performance '87 Proceedings of the 12th IFIP WG 7.3 International Symposium on Computer Performance Modelling, Measurement and Evaluation
Customer Routing on Polling Systems
Performance '90 Proceedings of the 14th IFIP WG 7.3 International Symposium on Computer Performance Modelling, Measurement and Evaluation
End-to-end delays in polling tree networks
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
Approximation of discrete-time polling systems via structured Markov chains
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
| Hi-index | 14.98 |
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.