Probabilistic models for computer architectures
Fundamentalʹnaâ i prikladnaâ matematika, Tome 3 (1997) no. 1, pp. 263-301
Voir la notice de l'article provenant de la source Math-Net.Ru
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.
@article{FPM_1997_3_1_a18,
author = {A. V. Filin and V. A. Malyshev and A. D. Manita},
title = {Probabilistic models for computer architectures},
journal = {Fundamentalʹna\^a i prikladna\^a matematika},
pages = {263--301},
publisher = {mathdoc},
volume = {3},
number = {1},
year = {1997},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/FPM_1997_3_1_a18/}
}
TY - JOUR AU - A. V. Filin AU - V. A. Malyshev AU - A. D. Manita TI - Probabilistic models for computer architectures JO - Fundamentalʹnaâ i prikladnaâ matematika PY - 1997 SP - 263 EP - 301 VL - 3 IS - 1 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/FPM_1997_3_1_a18/ LA - ru ID - FPM_1997_3_1_a18 ER -
A. V. Filin; V. A. Malyshev; A. D. Manita. Probabilistic models for computer architectures. Fundamentalʹnaâ i prikladnaâ matematika, Tome 3 (1997) no. 1, pp. 263-301. http://geodesic.mathdoc.fr/item/FPM_1997_3_1_a18/