ON THE COMPLEXITY OF FIXED-PRIORITY SCHEDULING OF PERIODIC, REAL-TIME TASKS

被引：501

作者：

LEUNG, JYT ^{[1
]}

WHITEHEAD, J ^{[1
]}

机构：

[1] CUNY QUEENS COLL,DEPT COMP SCI,FLUSHING,NY 11367

来源：

关键词：

D O I：

10.1016/0166-5316(82)90024-4

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：237 / 250

页数：14

共 8 条

[1] REAL-TIME SCHEDULING PROBLEM
DHALL, SK
LIU, CL
[J]. OPERATIONS RESEARCH, 1978, 26 (01) : 127 - 140
[2] Garey Michael R., 1979, COMPUTERS INTRACTABI
[3] Knuth D. E., 1969, ART COMPUTER PROGRAM, V2
[4] Labetoulle J., 1974, Computer Architectures and Networks, P285
[5] SCHEDULING PERIODICALLY OCCURRING TASKS ON MULTIPLE PROCESSORS
LAWLER, EL
MARTEL, CU
[J]. INFORMATION PROCESSING LETTERS, 1981, 12 (01) : 9 - 12
[6] A NOTE ON PREEMPTIVE SCHEDULING OF PERIODIC, REAL-TIME TASKS
LEUNG, JYT
MERRILL, ML
[J]. INFORMATION PROCESSING LETTERS, 1980, 11 (03) : 115 - 118
[7] SCHEDULING ALGORITHMS FOR MULTIPROGRAMMING IN A HARD-REAL-TIME ENVIRONMENT
LIU, CL
LAYLAND, JW
[J]. JOURNAL OF THE ACM, 1973, 20 (01) : 46 - 61
[8] SERLIN O, 1972, SPR P JOINT COMP C, P925