|
|
Itogi Nauki i Tekhniki. Seriya "Teoriya Veroyatnostei. Matematicheskaya Statistika. Teoreticheskaya Kibernetika", 1990, Volume 29, Pages 3–82
(Mi intv78)
|
|
|
|
This article is cited in 53 scientific papers (total in 53 papers)
Mathematical problems in the theory of shared-processor systems
S. F. Yashkov
Abstract:
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.
Citation:
S. F. Yashkov, “Mathematical problems in the theory of shared-processor systems”, Itogi Nauki i Tekhniki. Ser. Teor. Veroyatn. Mat. Stat. Teor. Kibern., 29, VINITI, Moscow, 1990, 3–82; J. Soviet Math., 58:2 (1992), 101–147
Linking options:
https://www.mathnet.ru/eng/intv78 https://www.mathnet.ru/eng/intv/v29/p3
|
|