SCHEDULING HARD REAL-TIME SYSTEMS - A REVIEW

被引：102

作者：

BURNS, A ^{[1
]}

机构：

[1] UNIV YORK,DEPT COMP SCI,YORK YO1 5DD,N YORKSHIRE,ENGLAND

来源：

SOFTWARE ENGINEERING JOURNAL | 1991年 / 6卷 / 03期

关键词：

D O I：

10.1049/sej.1991.0015

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

Recent results in the application of scheduling theory to hard real-time systems are reviewed in this paper. The review takes the form of an analysis of the problems presented by different application requirements and characteristics. Issues covered include uniprocessor and multiprocessor systems, periodic and aperiodic processes, static and dynamic algorithms, transient overloads and resource usage. Protocols that limit and reduce blocking are discussed. Consideration is also given to scheduling Ada tasks.

引用

页码：116 / 128

页数：13

共 86 条

[1]

Aarts E., 1988, SIMULATED ANNEALING

[2]

AUDSLEY N., 1990, YCS146 U YORK DEP CO

[3]

BABAOGLU O, 1990, PDCS17 U BOL DIP MAT

[4]

Baker T., 1990, Ada Letters, V10, P17

[5] TASK ALLOCATION IN FAULT-TOLERANT DISTRIBUTED SYSTEMS [J].

BANNISTER, JA ;

TRIVEDI, KS .

ACTA INFORMATICA, 1983, 20 (03) :261-281

[6]

BLAZEWICZ J, 1977, F CONTROL ENG, V1, P203

[7] A SHORTEST TREE ALGORITHM FOR OPTIMAL ASSIGNMENTS ACROSS SPACE AND TIME IN A DISTRIBUTED PROCESSOR SYSTEM [J].

BOKHARI, SH .

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1981, 7 (06) :583-589

[8]

Borger M., 1988, Ada Letters, V8, P7

[9]

BURNS A, 1989 P REAL TIM SYST, P267

[10]

BURNS A, 1989, ADA DESIGN CHOICE, P80

← 1 2 3 4 5 6 7 8 9 →