APPROXIMATE QUEUING MODELS FOR MULTIPROGRAMMING COMPUTER SYSTEMS

被引：61

作者：

AVIITZHAK, B

HEYMAN, DP

机构：

[1] ISRAEL INST TECHNOL, HAIFA, ISRAEL

[2] BELL TEL LABS INC, HOLMDEL, NJ 07733 USA

来源：

关键词：

D O I：

10.1287/opre.21.6.1212

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：1212 / 1230

页数：19

共 7 条

[1]

BUZEN J, 1971, P ACM WORKSHOP SYSTE, P82

[2] PROBABILITY MODELS FOR MULTIPROGRAMMING COMPUTER SYSTEMS [J].

GAVER, DP .

[3] CLOSED QUEUING SYSTEMS WITH EXPONENTIAL SERVERS [J].

GORDON, WJ ;

NEWELL, GF .

[4] JOBSHOP-LIKE QUEUING-SYSTEMS [J].

JACKSON, JR .

[5] NETWORKS OF WAITING LINES [J].

JACKSON, JR .

[6] A PROOF FOR THE QUEUING FORMULA - L=LAMBDA-W [J].

LITTLE, JDC .

[7]

TANAKA H, 1970, SYSTEMS COMPUTERS CO, V1, P37