FUNDAMENTALNAYA
I PRIKLADNAYA MATEMATIKA
(FUNDAMENTAL AND APPLIED MATHEMATICS)
1997, VOLUME 3, NUMBER 1, PAGES 263-301
A. V. Filin
V. A. Malyshev
A. D. Manita
Abstract
View as HTML
View as gif image
View as LaTeX source
Connections between priority queueing models and computer
architectures are widely known. But, as far as we know, there was no
formulation of exact models for sufficiently general computer
architecture models. This paper has two goals: the first and the
smaller one is just to give this formulation in exact mathematical
terms.
The second and the most important one is to present a new
approach to priority networks themselves. This approach is based on
recent advances in the dynamical system approach to queueing networks,
which in some very particular cases becomes a well-known fluid
approximation. This gives a new approach to performance evaluation of a
given computer architecture. We apply this method here to the
simplest architecture with the unique bus. This paper can be considered
as the first step in the
development of this approach.
All articles are published in Russian.
| Main page | Contents of the journal | News | Search |
Location: http://mech.math.msu.su/~fpm/eng/97/971/97119t.htm
Last modified: November 16, 1999