A parallel priority queueing system with finite buffers

Authors:
Aliakbar Montazer Haghighi;Dimitar P. Mishev
Affiliations:
Department of Mathematics, Prairie View A&M University, P.O. Box 4189, Prairie View, TX 77446, USA;Department of Mathematics, Prairie View A&M University, P.O. Box 4189, Prairie View, TX 77446, USA
Venue:
Journal of Parallel and Distributed Computing
Year:
2006

Citing 7
Cited 1

On a multiserver Markovian queueing system with balking and reneging

Computers and Operations Research
Load sharing with parallel priority queues

Journal of Computer and System Sciences
A parallel priority queue with constant time operations

Journal of Parallel and Distributed Computing - Parallel and distributed data structures
Randomized priority queues for fast parallel access

Journal of Parallel and Distributed Computing - Parallel and distributed data structures
An Efficient Parallel Algorithm for the Solution of a Tridiagonal Linear System of Equations

Journal of the ACM (JACM)
A parallel solver for large-scale Markov chains

Applied Numerical Mathematics - Developments and trends in iterative methods for large systems of equations—in memoriam Rüdiger Weiss
A Parallel Priority Data Structure with Applications

IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing

Optimizing a priority-discipline queueing model using fuzzy set theory

Computers & Mathematics with Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we pose and analyze a novel model of a priority queueing system that represents a conveyor model. What is novel in this model is that priority is designed to minimize the idleness of the system. Thus, we discussed a general parallel finite buffer multi-server priority queueing system with balking and reneging and analyze a two-station case of it. An algorithmic solution for the general two-station case and closed-form solutions for special cases of this model are given. We use block-matrix method to find distribution of the queue length, probability of the system idleness, probability of loss to the system, probability of stations being busy, and the first two moments. Numerical examples are given for comparison with Disney's model [R.L. Disney, Some multichannel queueing problems with order entry, J. Ind. Engng. 13 (1962) 46-48; R.L. Disney, D. Kogin, Queuing networks: a survey of their random processes, SIAM Rev. 27 (3) (1958) 335-400] and discussion of properties of the model.