The computation of steady-state distribution of parallel systems with two servers

Author

Locker, Vicky Faye ; Wang, P. Patrick

Author_Institution

Dept. of Math., Alabama Univ., Tuscaloosa, AL, USA

fYear

1997

fDate

9-11 Mar 1997

Firstpage

256

Lastpage

260

Abstract

This paper considers a queuing system that may be applied to specific networking systems and calculates the steady-state probabilities of the number of electronic signals waiting in this parallel queuing system to be transmitted. There are two identical servers, each has its own queue. Upon the arrival time, the new arrival goes into the shortest queue, and stays in that queue until it is served, i.e., no jockeying is allowed in this model. This is a well-known model. Using complex analysis and linear algebra, we are able to find the steady-state probabilities of the queue length. Numerical results are presented and the convergence rate is discussed

Keywords

linear algebra; parallel processing; performance evaluation; queueing theory; linear algebra; networking systems; numerical results; parallel systems; queuing system; servers; shortest queue; steady-state distribution; steady-state probabilities; Concurrent computing; Convergence of numerical methods; Distributed computing; Linear algebra; Mathematics; Network servers; Poisson equations; Probability; Queueing analysis; Steady-state;

fLanguage

English

Publisher

ieee

Conference_Titel

System Theory, 1997., Proceedings of the Twenty-Ninth Southeastern Symposium on

Conference_Location

Cookeville, TN

ISSN

0094-2898

Print_ISBN

0-8186-7873-9

Type

conf

DOI

10.1109/SSST.1997.581627

Filename

581627