Name
Abstract | ||
|---|---|---|
In a recent paper, Lam and Lien described an algorithm called tree-convolution that can reduce the space and computation time required for evaluating sparse multiclass, product-form queueing networks. In this paper, we develop an exact algorithm based on mean value analysis (MVA) that is the counterpart of the tree-convolution algorithm. The order of reduction in storage and computation achieved by our new Tree-MVA algorithm compared to the standard MVA algorithm is the same order of reduction obtained by the tree-convolution algorithm over that of the standard convolution algorithm. Our Tree-MVA algorithm preserves the inherent simplicity of MVA based algorithms. |
Year | DOI | Venue |
|---|---|---|
1986 | 10.1145/214419.214423 | ACM Trans. Comput. Syst. |
Keywords | Field | DocType |
tree-structured mean value analysis,recent paper,new tree-mva algorithm,multiple job classes.,convolution,mean value analysis,computation time,queueing network models,flow-equivalent stations,standard mva algorithm,tree-convolution algorithm,normalization constant,standard convolution algorithm,tree-mva algorithm,exact algorithm,inherent simplicity,tree structure | Mathematical optimization,Ramer–Douglas–Peucker algorithm,Simplex algorithm,Out-of-kilter algorithm,Computer science,In-place algorithm,Algorithm,FSA-Red Algorithm,Freivalds' algorithm,Population-based incremental learning,Difference-map algorithm | Journal |
Volume | Issue | ISSN |
4 | 2 | 0734-2071 |
Citations | PageRank | References |
10 | 0.70 | 11 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| K. P. Hoyme | 1 | 10 | 0.70 |
| S. C. Bruell | 2 | 133 | 22.86 |
| P. V. Afshari | 3 | 35 | 2.77 |
| R. Y. Kain | 4 | 21 | 15.40 |