Hostname: page-component-586b7cd67f-r5fsc Total loading time: 0 Render date: 2024-11-24T20:31:13.053Z Has data issue: false hasContentIssue false
  • English
  • Français

The steady-state distribution of spent service times present in the M/G/1 foreground–background processor-sharing queue

Published online by Cambridge University Press:  14 July 2016

R. Schassberger
R. Schassberger*
Affiliation:
Technical University of Berlin
*
∗ Postal address: Fachbereich 3 Mathematik, TU Berlin, Strasse des 17. Juni 135, D-1000 Berlin 12, W. Germany.
Get access Rights & Permissions [Opens in a new window]

Abstract

The steady-state distribution of spent service times present in the M/G/1 foreground-background processor-sharing queue is described by a random measure, whose generating functional is obtained.

Keywords

TIME-SHARINGPOINT PROCESSRANDOM MEASUREINDEPENDENT INCREMENTSINFINITE DIVISIBILITY
Type
Research Papers
Information
Journal of Applied Probability , Volume 25 , Issue 1 , March 1988 , pp. 194 - 203
Copyright
Copyright © Applied Probability Trust 1988 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1] Cohen, J. W. (1969) The Single Server Queue , 2nd edn. North-Holland, Amsterdam.Google Scholar
[2] Kallenberg, O. (1983) Random Measures. Academic Press, London.Google Scholar
[3] Kleinrock, L. (1976) Queuing Systems , Vol. 2. Wiley, New York.Google Scholar
[4] Pechinkin, A. V. (1981) Stationary probabilities in a system with discipline of advantageous distribution of a process. Eng. Cybern. 5, 73–77.Google Scholar
[5] Schassberger, R. (1984) A new approach to the M/G/1 processor-sharing queue. Adv. Appl. Prob. 16, 202–213.CrossRefGoogle Scholar
[6] Yashkov, S. F. (1984) Analysis of a system with priority-based processor sharing. Eng. Cybern. 18, (3), 29–38.Google Scholar