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

被引：506

作者：

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 [J].

DHALL, SK ;

LIU, CL .

[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 [J].

LAWLER, EL ;

MARTEL, CU .

[6] A NOTE ON PREEMPTIVE SCHEDULING OF PERIODIC, REAL-TIME TASKS [J].

LEUNG, JYT ;

MERRILL, ML .

LIU, CL ;

LAYLAND, JW .

[8]

SERLIN O, 1972, SPR P JOINT COMP C, P925