Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Morrison, J.A.
1986.
Moments of the conditioned waiting time in a large closed processor-sharing system.
Communications in Statistics. Stochastic Models,
Vol. 2,
Issue. 3,
p.
293.
Morrison, J. A.
1986.
Asymptotic Analysis of the Waiting-Time Distribution for a Large Closed Processor-Sharing System.
SIAM Journal on Applied Mathematics,
Vol. 46,
Issue. 1,
p.
140.
Gaver, Donald P.
and
Jacobs, Patricia A.
1986.
Processor-Shared Time-Sharing Models in Heavy Traffic.
SIAM Journal on Computing,
Vol. 15,
Issue. 4,
p.
1085.
Yashkov, S. F.
1987.
Processor-sharing queues: Some progress in analysis.
Queueing Systems,
Vol. 2,
Issue. 1,
p.
1.
McKenna, James
1987.
Asymptotic expansions of the sojourn time distribution functions of jobs in closed, product-form queuing networks.
Journal of the ACM,
Vol. 34,
Issue. 4,
p.
985.
Knessl, C.
Matkowsky, B. J.
Schuss, Z.
and
Tier, C.
1987.
Asymptotic Expansions for a Closed Multiple Access System.
SIAM Journal on Computing,
Vol. 16,
Issue. 2,
p.
378.
Weiss, Alan A.
and
Mitra, Debasis
1988.
A Transient Analysis of a Data Network with a Processor-Sharing Switch.
AT&T Technical Journal,
Vol. 67,
Issue. 5,
p.
4.
Morrison, J. A.
1988.
Conditioned Response-Time Distribution for a Large Closed Processor-Sharing System with Multiple Classes in Very Heavy Usage.
SIAM Journal on Applied Mathematics,
Vol. 48,
Issue. 6,
p.
1493.
Mitra, D.
and
Weiss, A.
1989.
A closed network with a discriminatory processor-sharing server.
p.
200.
Knessl, C.
Matkowsky, B. J.
Schuss, Z.
and
Tier, C.
1989.
Response times in processor-shared queuses with state-dependent arrival rates.
Communications in Statistics. Stochastic Models,
Vol. 5,
Issue. 1,
p.
83.
Mitra, D.
and
Weiss, A.
1989.
A closed network with a discriminatory processor-sharing server.
ACM SIGMETRICS Performance Evaluation Review,
Vol. 17,
Issue. 1,
p.
200.
Knessl, Charles
1990.
On Finite Capacity Processor-Shared Queues.
SIAM Journal on Applied Mathematics,
Vol. 50,
Issue. 1,
p.
264.
Kel'bert, M. Ya.
and
Sukhov, Yu. M.
1990.
Mathematical theory of queuing networks.
Journal of Soviet Mathematics,
Vol. 50,
Issue. 3,
p.
1527.
Walrand, Jean
1990.
Stochastic Models.
Vol. 2,
Issue. ,
p.
519.
Fendick, Kerry W.
and
Rodrigues, Manoel A.
1991.
A heavy-traffic comparison of shared and segregated buffer schemes for queues with the head-of-line processor-sharing discipline.
Queueing Systems,
Vol. 9,
Issue. 1-2,
p.
163.
Morrison, J. A.
1991.
Asymptotic analysis of a large closed queueing network with discriminatory processor sharing.
Queueing Systems,
Vol. 9,
Issue. 1-2,
p.
191.
Bersani, Alberto
and
Sciarretta, Cicilia
1991.
Asymptotic Analysis for a Closed Processor-Sharing System with Switching Times: Normal Usage.
SIAM Journal on Applied Mathematics,
Vol. 51,
Issue. 2,
p.
525.
Knessl, Charles
and
Tier, Charles
1992.
A Processor-Shared Queue That Models Switching Times: Normal Usage.
SIAM Journal on Applied Mathematics,
Vol. 52,
Issue. 3,
p.
883.
Charles, Knessl
1992.
Asymptotic approximations for the gi/m/1 queue with processor-sharing service.
Communications in Statistics. Stochastic Models,
Vol. 8,
Issue. 1,
p.
1.
Yashkov, S. F.
1992.
Mathematical problems in the theory of shared-processor systems.
Journal of Soviet Mathematics,
Vol. 58,
Issue. 2,
p.
101.