Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Ott, Teunis J.
1984.
The sojourn-time distribution in the M/G/1 queue by processor sharing.
Journal of Applied Probability,
Vol. 21,
Issue. 02,
p.
360.
Morrison, J. A.
and
Mitra, D.
1985.
Heavy-usage asymptotic expansions for the waiting time in closed processor-sharing systems with multiple classes.
Advances in Applied Probability,
Vol. 17,
Issue. 1,
p.
163.
Daduna, Hans
1985.
Messung, Modellierung und Bewertung von Rechensystemen.
p.
127.
Yashkov, S.F
1985.
Distribution of number of jobs in a feedback processor-sharing queue.
Annual Review in Automatic Programming,
Vol. 12,
Issue. ,
p.
464.
Daduna, Hans
1986.
DGOR.
p.
514.
Avi-Itzhak, Benjamin
and
Halfin, Shlomo
1987.
Server sharing with a limited number of service positions and symmetric queues.
Journal of Applied Probability,
Vol. 24,
Issue. 4,
p.
990.
Yashkov, S. F.
1987.
Processor-sharing queues: Some progress in analysis.
Queueing Systems,
Vol. 2,
Issue. 1,
p.
1.
Yashkov, S. E.
1988.
Systems Analysis and Simulation II.
Vol. 2,
Issue. ,
p.
158.
Grishechkin, S. A.
1988.
Single-channel system with circular access or processor-sharing and branching processes.
Mathematical Notes of the Academy of Sciences of the USSR,
Vol. 44,
Issue. 4,
p.
716.
Schassberger, R.
1988.
The steady-state distribution of spent service times present in the M/G/1 foreground–background processor-sharing queue.
Journal of Applied Probability,
Vol. 25,
Issue. 01,
p.
194.
Jagerman, David L.
and
Sengupta, Bhaskar
1989.
A Functional Equation Arising in a Queue With a Gating Mechanism.
Probability in the Engineering and Informational Sciences,
Vol. 3,
Issue. 3,
p.
417.
Sengupta, Bhaskar
1989.
A perturbation method for solving some queues with processor sharing discipline.
Journal of Applied Probability,
Vol. 26,
Issue. 01,
p.
209.
van den Berg, J. L.
1989.
Messung, Modellierung und Bewertung von Rechensystemen und Netzen.
Vol. 218,
Issue. ,
p.
105.
Schassberger, R.
1990.
The steady-state appearance of the M/G/1 queue under the discipline of shortest remaining processing time.
Advances in Applied Probability,
Vol. 22,
Issue. 2,
p.
456.
Schassberger, R.
1990.
The steady-state appearance of the M/G/1 queue under the discipline of shortest remaining processing time.
Advances in Applied Probability,
Vol. 22,
Issue. 2,
p.
456.
Resing, J. A. C.
Hooghiemstra, G.
and
Keane, M. S.
1990.
The M/G/1 processor sharing queue as the almost sure limit of feedback queues.
Journal of Applied Probability,
Vol. 27,
Issue. 04,
p.
913.
Jagerman, David L.
and
Bhaskar, Sengupta
1991.
The gi/m/1 processor-sharing queue and its heavy traffic analysis.
Communications in Statistics. Stochastic Models,
Vol. 7,
Issue. 3,
p.
379.
van den Berg, J. L.
and
Boxma, O. J.
1991.
TheM/G/1 queue with processor sharing and its relation to a feedback queue.
Queueing Systems,
Vol. 9,
Issue. 4,
p.
365.
Grishechkin, S. A.
1992.
On the Use of Branching Processes for Finding Steady-State Distributions in Queueing Theory.
Theory of Probability & Its Applications,
Vol. 36,
Issue. 3,
p.
477.
Grishechkin, S. A.
1992.
Crump–Mode–Jagers Branching Processes As a Method of Investigating ${\rm M}/{\rm G}/1$ Systems with Processor Sharing.
Theory of Probability & Its Applications,
Vol. 36,
Issue. 1,
p.
19.