메뉴 건너뛰기




Volumn , Issue , 1983, Pages 70-81

Workload representations in queueing models of computer systems

Author keywords

[No Author keywords available]

Indexed keywords

EQUIVALENCE CLASSES; QUEUEING NETWORKS; QUEUEING THEORY; SALES;

EID: 84954505389     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/800040.801396     Document Type: Conference Paper
Times cited : (10)

References (9)
  • 1
    • 0019633577 scopus 로고    scopus 로고
    • A simple approach to system modeling
    • Bard, Y., A Simple Approach to System Modeling, Performance Evaluation 1,3, pp. 225-248.
    • Performance Evaluation , vol.1 , Issue.3 , pp. 225-248
    • Bard, Y.1
  • 3
    • 0016354709 scopus 로고
    • Guidelines for use of infinite source queueing models in the analysis of computer system performance
    • Buzen, J.P., and Goldberg, R., Guidelines for Use of Infinite Source Queueing Models in the Analysis of Computer System Performance, Proc, AFIPS NCC 43 (1974).
    • (1974) Proc, AFIPS NCC 43
    • Buzen, J.P.1    Goldberg, R.2
  • 8
    • 0000861722 scopus 로고
    • A proof of the queueing formula l = λw
    • Little, J.D.C., A Proof of the Queueing Formula L = λW, Operations Research 9 (1961), pp 383-387.
    • (1961) Operations Research , vol.9 , pp. 383-387
    • Little, J.D.C.1
  • 9
    • 0000120744 scopus 로고
    • An approximate analytical method for general queueing networks
    • Sept
    • Marie, R., An Approximate Analytical Method for General Queueing Networks, IEEE Transactions on Software Engineering SE-5,5, (Sept. 1979).
    • (1979) IEEE Transactions on Software Engineering SE-5 , vol.5
    • Marie, R.1


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