Title :
A note on the computational cost of the Linearizer algorithm for queueing networks
Author :
Silva, E. De Souza E ; Muntz, Richard R.
Author_Institution :
Federal Univ. of Rio de Janeiro, Brazil
fDate :
6/1/1990 12:00:00 AM
Abstract :
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(MK3) 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(MK2)
Keywords :
approximation theory; performance evaluation; queueing theory; Linearizer algorithm; algebraic manipulation; approximation algorithms; closed-product-form queueing networks; computational cost; numeric solutions; Approximation algorithms; Computational efficiency; Computer errors; Decoding; Encoding; Error correction codes; Fault tolerance; Linear code; Minimization; Table lookup;
Journal_Title :
Computers, IEEE Transactions on
