메뉴 건너뛰기
Operations Research Letters
Volumn 35, Issue 4, 2007, Pages 463-466
Explicit formulas for the variance of conditioned sojourn times in M/D/1-PS
Author keywords

Branching; Processor sharing; Sojourn times; Variance
Indexed keywords

OPERATIONS RESEARCH; PROGRAM PROCESSORS;
EID: 34248551333     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2006.08.006     Document Type: Article
Times cited : (2)
References (6)
  • 1
    • 0014706192 scopus 로고
    • Waiting time distributions for processor-sharing system
    • Coffman E.G., Muntz R., and Trotter H. Waiting time distributions for processor-sharing system. J. Assoc. Comput. Math. 17 (1970) 123-130
    • (1970) J. Assoc. Comput. Math. , vol.17 , pp. 123-130
    • Coffman, E.G.1    Muntz, R.2    Trotter, H.3
  • 2
    • 0021446722 scopus 로고
    • The sojourn-time distribution in the M/G/1 queue with processor sharing
    • Ott T.J. The sojourn-time distribution in the M/G/1 queue with processor sharing. J. Appl. Probab. 21 (1984) 360-378
    • (1984) J. Appl. Probab. , vol.21 , pp. 360-378
    • Ott, T.J.1
  • 3
    • 0000724572 scopus 로고
    • A new approach to the M/G/1 processor-sharing queue
    • Schassberger R. A new approach to the M/G/1 processor-sharing queue. Adv. Appl. Probab. 16 (1984) 202-213
    • (1984) Adv. Appl. Probab. , vol.16 , pp. 202-213
    • Schassberger, R.1
  • 4
    • 0000705288 scopus 로고
    • A derivation of the response time distribution for a M/G/1 processor-sharing queue
    • Yashkov S.F. A derivation of the response time distribution for a M/G/1 processor-sharing queue. Probl. Control Inform. Theory 12 (1983) 133-148
    • (1983) Probl. Control Inform. Theory , vol.12 , pp. 133-148
    • Yashkov, S.F.1
  • 5
    • 0001775785 scopus 로고
    • Processor-sharing queues: some progress in analysis
    • Yashkov S.F. Processor-sharing queues: some progress in analysis. Queueing Syst. 2 (1987) 1-17
    • (1987) Queueing Syst. , vol.2 , pp. 1-17
    • Yashkov, S.F.1
  • 6
    • 0034341928 scopus 로고    scopus 로고
    • Sojourn time asymptotics in the M/G/1 processor sharing queue
    • Zwart A.P., and Boxma O.J. Sojourn time asymptotics in the M/G/1 processor sharing queue. Queueing Syst. 35 1-4 (2000) 141-166
    • (2000) Queueing Syst. , vol.35 , Issue.1-4 , pp. 141-166
    • Zwart, A.P.1    Boxma, O.J.2

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.