|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| E. de Souza e Silva, R.R. Muntz, "A Note on the Computational Cost of the Linearizer Algorithm for Queueing Networks," IEEE Transactions on Computers, vol. 39, no. 6, pp. 840-842, June, 1990. | |||
| BibTex | x | ||
| @article{ 10.1109/12.53607, author = {E. de Souza e Silva and R.R. Muntz}, title = {A Note on the Computational Cost of the Linearizer Algorithm for Queueing Networks}, journal ={IEEE Transactions on Computers}, volume = {39}, number = {6}, issn = {0018-9340}, year = {1990}, pages = {840-842}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.53607}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - A Note on the Computational Cost of the Linearizer Algorithm for Queueing Networks IS - 6 SN - 0018-9340 SP840 EP842 EPD - 840-842 A1 - E. de Souza e Silva, A1 - R.R. Muntz, PY - 1990 KW - omputational cost; Linearizer algorithm; approximation algorithms; numeric solutions; closed-product-form queueing networks; algebraic manipulation; approximation theory; performance evaluation; queueing theory. VL - 39 JA - IEEE Transactions on Computers ER - | |||
Linearizer is one of the best known approximation algorithms for obtaining numeric solutions for closed-product-form queueing networks. In the original exposition of Linearizer, the computational cost was stated to be O(MK/sup 3/) for a model with M queues and K job classes. It is shown that with some straightforward algebraic manipulation, Linearizer can be modified to require a cost that is only O(MK/sup 2/).
[1] M. Reiser and S. Lavenberg, "Mean value analysis of closed multichain queueing networks,"J. ACM, vol. 27, no. 2, Apr. 1980.
[2] K. Chandy and D. Neuse, "Linearizer: A heuristic algorithm for queueing network models of computing systems,"Commun. ACM, vol. 25, no. 2, pp. 126-134, 1982.
[3] E. A. de Souza e Silva, S. S. Lavenberg, and R. R. Muntz, "Clustering approximation technique for queueing network models with a large number of chains,"IEEE Trans. Computers, vol. C-35, pp. 419-430, May 1986.