For the coupled processor model with exponential service times, an approach is presented to calculate the stationary distribution of the queue length. In this approach the stationary probabilities are expressed as power series in the parameter ρ, the traffic intensity of the system. The method is not restricted to state spaces (of the underlying continuous time Markov chain) of dimension two, but applies equally well to higher-dimensional state spaces.
No takes yet. Share an insight, caveat, or question.
Hooghiemstra et al. (1988) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: