A DISCRETE-TIME ROUND-ROBIN QUEUE WITH BERNOULLI INPUT AND GENERAL ARITHMETIC SERVICE TIME DISTRIBUTIONS

被引：12

作者：

DADUNA, H

SCHASSBERGER, R

机构：

来源：

ACTA INFORMATICA | 1981年 / 15卷 / 03期

关键词：

D O I：

10.1007/BF00289264

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：251 / 263

页数：13

共 11 条

[1]

ADIRI I, 1969, MANAGEMENT SCI, V18, P639

[2] WAITING TIME DISTRIBUTIONS FOR PROCESSOR-SHARING SYSTEMS [J].

COFFMAN, EG ;

MUNTZ, RR ;

TROTTER, H .

JOURNAL OF THE ACM, 1970, 17 (01) :123-&

[3] SHARING A PROCESSOR AMONG MANY JOB CLASSES [J].

FAYOLLE, G ;

MITRANI, I ;

IASNOGORODSKI, R .

JOURNAL OF THE ACM, 1980, 27 (03) :519-532

[4]

Feller W., 1965, INTRO PROBABILITY TH, VII

[5]

Kleinrock L., 1976, QUEUING SYSTEMS, VII

[6]

KLEINROCK L, 1964, NAVAL RES LOGIST Q, V2, P59

[7]

KOBAYASHI H, 1975, B7528 ALOHA U HAW SY

[8] A QUEUEING THEORY STUDY OF ROUND-ROBIN SCHEDULING OF TIME-SHARED COMPUTER SYSTEMS [J].

RASCH, PJ .

JOURNAL OF THE ACM, 1970, 17 (01) :131-&

[9] ANALYSIS OF M/G/1 QUEUE UNDER ROUND-ROBIN SCHEDULING [J].

SAKATA, M ;

NOGUCHI, S ;

OIZUMI, J .

OPERATIONS RESEARCH, 1971, 19 (02) :371-&

[10]

Schassberger R., 1973, WARTESCHLANGEN, DOI [10.1007/978-3-7091-8309-0, DOI 10.1007/978-3-7091-8309-0]

← 1 2 →