1,721,395 research outputs found
Two queues with alternating service and switching times
Full text linktlThis paper is concerned with a system of two queues, attended by a single server who alternately serves one customer of each queue (if not empty). The server experiences switching times in his transition from one queue to the other. It is shown that the joint stationary queue-Iength distribution, at the instants at which the server becomes available to a queue, can be determined via transformation to a Riemann boundary value problem. The latter problem can be completely solved for general service- and switching-time distributions.
The stationary distributions of the waiting times at both queues, and of the cycle times of the server, are also derived. The results obtained, and in particular the extensive numerical data for moments of waiting times and cycle times, yield insight into the behavior of more general cyclic-service modeIs. Such modeIs are frequenUy used to analyse polling systems
A recursive aggregation-disaggregation method to approximate large-scale closed queuing networks with multiple job types
No full textThis paper deals with a new approximation method for large scale queuing network models with multiple job types.
In recent years mean value oriented approximation algorithms have received much attention. Most of the approximation methods are based on decomposition and aggregation arguments and use iteration to obtain a fixed point of an implicitly defined set of non-linear equations for the relevant performance measures, such as mean response times, throughputs and mean queue lengths.
In this paper a recursive aggregation-disaggregation method is introduced to bypass the computational problems involved in evaluating the standard multidimensional recursive schemes associated with exact mean value analysis in separable queuing networks with multiple job types. As a side result we study the influence of Pollaczek-Khintchine type approximations for the mean response times at first-in first-out single server queues with non-exponential service demand distributions.
The power of the method is tested with a closed central server model involving multiple central processors, disk units and job types
The power-series algorithm: A numerical approach to Markov processes
Full text linkThe development of computer and communication networks and flexible manufacturing systems has led to new and interesting multidimensional queueing models. The Power-Series Algorithm is a numerical method to analyze and optimize the performance of such models. In this thesis, the applicability of the algorithm is extended. This is illustrated by introducing and analyzing a wide class of queueing networks with very general dependencies between the different queues. The theoretical basis of the algorithm is strengthened by proving analyticity of the steady-state distribution in light traffic and finding remedies for previous imperfections of the method. Applying similar ideas to the transient distribution renders new analyticity results. Various aspects of Markov processes, analytic functions and extrapolation methods are reviewed, necessary for a thorough understanding and efficient implementation of the Power-Series Algorithm
Computer performance and reliability : proceedings of the second International MCPR workshop held in Rome, Italy, May 25-29, 1987
No full textScheduling (Report from Dagstuhl Seminar 13111, March 10-15, 2013)
No full textThis report documents the program and the outcomes of Dagstuhl Seminar 13111 "Scheduling". The primary objective of the seminar is to facilitate dialog and collaboration between researchers in two different mathematically-oriented scheduling research communities, the stochastic scheduling and queuing community, and the worst-case approximation scheduling community
Teletraffic analysis and computer performance evaluation : proceedings of the international seminar held at the Centre for Mathematics and Computer Science (CWI), June 2-6, 1986, Amsterdam, The Netherlands
No full textA queueing model of finite and infinite source interaction
Full text linkAn M/M/1 service system is considered, which also serves one finite source. The joint distribution of queue length at the M/M/1 queue and position of the finite source customer in the system is determined. This leads to exact expressions for various performance measures; such expressions yield insight into the interaction of finite and infinite sources
Computer performance and reliability : proceedings of the second International MCPR workshop held in Rome, Italy, May 25-29, 1987
No full text- …
