MULTIPROCESSOR SCHEDULING OF PROCESSES WITH RELEASE TIMES, DEADLINES, PRECEDENCE, AND EXCLUSION RELATIONS

被引：64

作者：

XU, J

机构：

[1] Department of Computer Science, York University, North York

来源：

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING | 1993年 / 19卷 / 02期

基金：

加拿大自然科学与工程研究理事会;

关键词：

AUTOMATED PRE-RUN-TIME SCHEDULER; DEADLINES; EXCLUSION; HARD-REAL-TIME SYSTEMS; MULTIPROCESSOR; OPTIMAL SCHEDULING ALGORITHM; PRECEDENCE;

D O I：

10.1109/32.214831

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

We present a scheduling algorithm that solves the problem of finding a feasible nonpreemptive schedule whenever one exists on M identical processors for a given set of processes such that each process starts executing after its release time and completes its computation before its deadline, and a given set of precedence relations and a given set of exclusion relations defined on ordered pairs of process segments are satisfied. This algorithm can be applied to the important problem of automated pre-run-time scheduling of processes with arbitrary precedence and exclusion relations on multiprocessors in hard-real-time systems.

引用

页码：139 / 154

页数：16

共 21 条

[1]

[Anonymous], 1983, THESIS MASSACHUSETTS

[2] SCHEDULING SUBJECT TO RESOURCE CONSTRAINTS - CLASSIFICATION AND COMPLEXITY [J].