ONLINE SCHEDULING OF REAL-TIME TASKS

被引：38

作者：

HONG, KS ^{[1
]}

LEUNG, JYT ^{[1
]}

机构：

[1] UNIV NEBRASKA,DEPT COMP SCI & ENGN,LINCOLN,NE 68588

来源：

IEEE TRANSACTIONS ON COMPUTERS | 1992年 / 41卷 / 10期

关键词：

DEADLINE; MULTIPROCESSOR SYSTEM; ONLINE AND OFF-LINE SCHEDULES; PROCESSOR DOWNTIME; REAL-TIME TASK; RELEASE TIME;

D O I：

10.1109/12.166609

中图分类号：

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

学科分类号：

0812 ;

摘要：

An optimal on-line scheduler is given for a set of real-time tasks with one common deadline on m processors. It is shown that no optimal on-line scheduler can exist for tasks with two distinct deadlines. Finally, an optimal on-line scheduler is given for situations where processors can go down unexpectedly.

引用

页码：1326 / 1331

页数：6

共 12 条

[1]

Coffman Jr E. G., 1973, OPERATING SYSTEMS TH

[2]

Dertouzos Michael, 1974, P IFIP C, P807

[3] PREEMPTIVE SCHEDULING OF UNIFORM PROCESSOR SYSTEMS [J].