Geodesic
Mathematical problems in the theory of shared-processor systems
Itogi nauki i tehniki. Seriâ, Teoriâ veroâtnostej. Matematičeskaâ statistika. Teoretičeskaâ kibernetika, Itogi Nauki i Tekhniki. Seriya "Teoriya Veroyatnostei. Matematicheskaya Statistika. Teoreticheskaya Kibernetika", Tome 29 (1990), pp. 3-82 
S. F. Yashkov. Mathematical problems in the theory of shared-processor systems. Itogi nauki i tehniki. Seriâ, Teoriâ veroâtnostej. Matematičeskaâ statistika. Teoretičeskaâ kibernetika, Itogi Nauki i Tekhniki. Seriya "Teoriya Veroyatnostei. Matematicheskaya Statistika. Teoreticheskaya Kibernetika", Tome 29 (1990), pp. 3-82. http://geodesic.mathdoc.fr/item/INTV_1990_29_a0/
@article{INTV_1990_29_a0,
     author = {S. F. Yashkov},
     title = {Mathematical problems in the theory of shared-processor systems},
     journal = {Itogi nauki i tehniki. Seri\^a, Teori\^a vero\^atnostej. Matemati\v{c}eska\^a statistika. Teoreti\v{c}eska\^a kibernetika},
     pages = {3--82},
     year = {1990},
     volume = {29},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/INTV_1990_29_a0/}
}
TY  - JOUR
AU  - S. F. Yashkov
TI  - Mathematical problems in the theory of shared-processor systems
JO  - Itogi nauki i tehniki. Seriâ, Teoriâ veroâtnostej. Matematičeskaâ statistika. Teoretičeskaâ kibernetika
PY  - 1990
SP  - 3
EP  - 82
VL  - 29
UR  - http://geodesic.mathdoc.fr/item/INTV_1990_29_a0/
LA  - ru
ID  - INTV_1990_29_a0
ER  - 
%0 Journal Article
%A S. F. Yashkov
%T Mathematical problems in the theory of shared-processor systems
%J Itogi nauki i tehniki. Seriâ, Teoriâ veroâtnostej. Matematičeskaâ statistika. Teoretičeskaâ kibernetika
%D 1990
%P 3-82
%V 29
%U http://geodesic.mathdoc.fr/item/INTV_1990_29_a0/
%G ru
%F INTV_1990_29_a0

Voir la notice du chapitre de livre provenant de la source Math-Net.Ru

This article considers new approaches in queuing theory associated with mathematical modelling and analysis of contemporary computer systems and networks using shared processors. Emphasis is placed on results concerning exact determination of probability distributions for such characteristics as sojourn times and waiting times. Various methods of analyzing shared-processor systems are considered, their characteristics analyzed, and special attention is devoted to the broad class of $M|GI|1$ queuing disciplines that result in Poisson throughput. Several limit theorems for heavyload conditions are described.