Summary
This paper develops efficient computational algorithms for some models that utilize phase type distributions. As in other instances, such as matrix-geometric methods, where the PH-distribution lends itself to useful and efficient computational methods, we examine how certain probabilities based on these distributions may be efficiently computed. The examples that we consider include token ring networks, simple multiqueues, and order statistics. By exploiting the geometric nature of PH-densities, it is shown that certain exponential time computations can be reduced to linear time, if recursive algorithms are used. We demonstrate speedup with the aid of a practical example, using a recursive as well as a nonrecursive algorithm, in verifying the stability of a queue on a token ring network.
Similar content being viewed by others
References
Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progessions. Proceedings of the 19th Annual ACM Symposium on Theory of Computing, pp. 1–6 (1987)
Lai, T.L., Robbins, H.: A class of dependent random variables and their maxima. Z. Wahrscheinlichkeitstheorie Verw. Geb. 42, 89–111 (1978)
Moore, F.: Computational model of a closed queueing network with exponential servers. IBM J. Res. Develop. 16, 567–572 (1972)
Neuts, M.F.: Matrix-analytic methods in queueing theory. Eur. J. Operational Res. 15, 2–12 (1984)
Neuts, M.F.: Matrix-geometric solutions in stochastic models: An algorithmic approach. First Ed. Baltimore: The Johns Hopkins University Press 1981
Rego, V.J., Szpankowski, W.: On the quality of approximations for high speed rings. Proceedings of the International Symposium on High Performance Computer Systems, Paris, France, 14–16 December 1987. Gelenbe, E. (ed.) Amsterdam: North Holland, p. 179–193 (1988)
Rego, V.J., Ni, L.M.: Analytic models of cyclic service systems and their application to tokenpassing local networks. IEEE Trans. Comput. 37, 1224–1234 (1988)
Takagi, H.: Analysis of polling systems, First Ed. M.I.T. Press: Cambridge, MA 1986
Trivedi, K.S.: Probability and statistics with reliability. Queueing, Comput. Sci. Appl. Englewood Cliffs, NJ: Prentice Hall 1982
Williams, A., Bhandiwad, R.: A generating function approach to queueing network analysis of multiprogrammed computers. Networks 6, 1–22 (1976)
Szpankowski, W., Rego, V.J.: Ultimate stability conditions for some multidimensional distributed systems. Purdue CSD-TR 715, October 1987
Author information
Authors and Affiliations
Additional information
This research was supported in part by the National Science Foundation under grant NCR-8702115 and in part by a 1987 Purdue XL grant
Rights and permissions
About this article
Cite this article
Rego, V. Some efficient computational algorithms related to phase models. Acta Informatica 27, 157–177 (1989). https://doi.org/10.1007/BF00265152
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00265152